#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>

#define rep(i,n) for(i=0; i<n; ++i)
#define inc_rep(i,a,n) for(i=a; i<n; ++i)
#define dec_rep(i,n,a) for(i=n; i>=a; --i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
#define print_vec(v) for(auto it=v.begin();it!=v.end();++it)cout<<*it <<" ";cout<<endl
#define print_vec2d(v) for(int i=0;i<v.size();++i){for(int j=0;j<v[i].size();++j)cout<<v[i][j]<<" ";cout<<endl;}cout<<endl
using namespace std;
using lint = long long;

int main(void){
    lint i, j, k, cnt=0, x, y;
    lint p, q, n, m;
    string s;
    in(s);
    vector<vector<lint> > D(26, vector<lint> (26));
    vector<vector<string> > X(26, vector<string> (26, "A"));
    rep(i,26){
        rep(j,26) in(D[i][j]);
    }
    rep(i,s.size()){
        inc_rep(j,i+1,s.size()){
            if(X[s[i]-'a'][s[j]-'a']!="N") i+D[s[i]-'a'][s[j]-'a']<=j?X[s[i]-'a'][s[j]-'a']="Y":X[s[i]-'a'][s[j]-'a']="N";
        }
    }
    rep(i,26){
        rep(j,26){
            if(X[i][j]=="A") X[i][j]="Y";
        }
    }

    // rep(i,26){
    //     rep(j,26){
    //         if(i>=j) X[i][j]="Y";
    //         else if(i<s.size()&&j<s.size()) i+D[s[i]-'a'][s[j]-'a']<=j?X[s[i]-'a'][s[j]-'a']="Y":X[s[i]-'a'][s[j]-'a']="N";
    //         else X[i][j]="Y";
    //     }
    // }
    rep(i,26){
        rep(j,26){
            out(X[i][j],"");
            if(j<25) out(" ","");
        }
        out("",endl);
    }
    
    return 0;
}