#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    string s;cin >> s;
    vvl v(26,vl(26));
    rep(i,26)rep(j,26)cin >> v[i][j];
    bool ok=true;
    vector<vl> idx(26);
    vvl ans(26,vl(26,1));
    rep(i,s.size()){
        idx[s[i]-'a'].emplace_back(i);
    }
    rep(i,26)idx[i].emplace_back(INF);
    rep(i,s.size()){
        rep(j,26){
            ll p=*upper_bound(all(idx[j]),i);
            if(i+v[i][j]>p)ans[i][j]=false;
        }
    }
    rep(i,26){
        rep(j,26)cout << (ans[i][j]? "Y":"N") <<" ";cout << endl;
    }
}