#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

typedef long long ll;
typedef modint998244353 mint;
const int MOD = 1000000007;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
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; }

int main(){
    string s;
    cin >> s;
    vector<vector<int>> a(26, vector<int>(26));
    rep(i, 26) rep(j, 26) cin >> a[i][j];

    vector<vector<int>> vec(26);
    rep(i, s.size()) vec[s[i] - 'a'].push_back(i);

    rep(i, 26){
        rep(j, 26){
            bool b = true;
            rep(k, vec[i].size()){
                if(vec[j].size() == 0 || vec[j][vec[j].size() - 1] <= vec[i][k]) continue;
                auto it = upper_bound(all(vec[j]), vec[i][k]);
                if(vec[i][k] + a[i][j] > vec[j][it - vec[j].begin()]) b = false;
            }
            if(b) cout << "Y" << ' ';
            else cout << "N" << ' ';
        }
        cout << endl;
    }

    return 0;
}