#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;
    vector<vector<int> > D(26, vector<int> (26));
    in(s);
    rep(i,26){
        rep(j,26){
            in(D[i][j]);
        }
    }
    vector<vector<int> > c_cnt(26);
    rep(i,s.size()) c_cnt[s[i]-'a'].push_back(i);

    vector<vector<char> > X(26, vector<char> (26, 'A'));
    rep(i,26){
        rep(j,26){
            rep(x,c_cnt[i].size()){
                rep(y,c_cnt[j].size()){
                    if(c_cnt[i][c_cnt[i].size()-x-1]<c_cnt[j][y]){
                        if(c_cnt[i][c_cnt[i].size()-x-1]+D[i][j]>c_cnt[j][y]) {X[i][j]='N';}
                        break;
                    }
                }
            }
        }
    }
    rep(i,26){
        rep(j,26){
            if(X[i][j]=='A')    X[i][j]='Y';
        }
    }
    rep(i,26){
        rep(j,26){
            out(X[i][j],"");
            if(j<25)    out(" ","");
        }
        out("",endl);
    }
    
    return 0;
}