#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

int main(){
    string s;
    cin >> s;

    vector<vector<ll>> d(26, vector<ll>(26));
    rep(i, 26) rep(j, 26) cin >> d[i][j];

    vector<vector<ll>> pos(26);
    rep(i, (ll)s.size()) pos[s[i]-'a'].pb(i);

    rep(i, 26){
        rep(j, 26){
            bool flag = true;
            for(ll x : pos[i]){
                auto itr = upper_bound(all(pos[j]), x);
                if(itr == pos[j].end()) continue;
                if(x+d[i][j] > *itr){
                    flag = false;
                    break;
                }
            }

            if(flag){
                cout << "Y ";
            }else{
                cout << "N ";
            }
        }
        cout << endl;
    }
}