#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#include <sstream>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  string S; cin >> S;
  vector<vector<int>> A(26, vector<int>(26));
  rep(y,26) rep(x,26) cin >> A[y][x];
  vector<vector<int>> pos(26);
  rep(i,sz(S)){
    pos[S[i]-'a'].pb(i);
  }
  string ny = "NY";
  rep(a,26){
    rep(b,26){
      int flag = 1;
      rep(i,sz(pos[a])){
        int p = pos[a][i];
        auto x = upper_bound(all(pos[b]),p);
        if(x!=pos[b].end()&&p+A[a][b]>*x) flag=0;
      }
      if(b) cout << ' ';
      cout << ny[flag];
    }
    cout << '\n';
  }
  return 0;
}