#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr int dx[] = {1, 0, -1, 0};
constexpr int dy[] = {0, 1, 0, -1};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string S;
    cin >> S;
    int n = S.length();
    vector D(26, vector<int>(26));
    for(int i = 0; i < 26; ++i){
        for(int j = 0; j < 26; ++j){
            cin >> D[i][j];
        }
    }
    vector<vector<int>> pos(26);
    for(int i = 0; i < n; ++i){
        pos[S[i] - 'a'].emplace_back(i);
    }
    vector ans(26, vector<bool>(26, true));
    for(int a = 0; a < 26; ++a){
        for(int i : pos[a]){
            for(int b = 0; b < 26; ++b){
                int idx = upper_bound(begin(pos[b]), end(pos[b]), i) - begin(pos[b]);
                if(idx == pos[b].size())    continue;
                int j = pos[b][idx];
                ans[a][b] = ans[a][b] & (D[a][b] <= j - i);
            }
        }
    }
    for(int i = 0; i < 26; ++i){
        for(int j = 0; j < 26; ++j){
            cout << (ans[i][j] ? "Y " : "N ");
        }
        cout << '\n';
    }

    return 0;
}