#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    string s; cin >> s;
    vector<vector<int>> indices(26);
    int n = s.size();
    for(int i = 0; i < n; i++){
        indices[s[i]-'a'].push_back(i);
    }
    auto larger = indices;
    for(int i = 0; i < 26; i++){
        sort(larger[i].begin(), larger[i].end(), greater<int>());
    }
    auto min_diff = vec2d(26, 26, (int)1e9);
    for(int i = 0; i < n; i++){
        int x = s[i]-'a';
        for(int j = 0; j < 26; j++){
            while(!larger[j].empty() && larger[j].back() <= i) larger[j].pop_back();
            if(!larger[j].empty()){
                chmin(min_diff[x][j], larger[j].back()-i);
            }
        }
    }

    auto d = vec2d(26, 26, 0);
    for(int i = 0; i < 26; i++){
        for(int j = 0; j < 26; j++){
            cin >> d[i][j];
        }
    }
    for(int i = 0; i < 26; i++){
        for(int j = 0; j < 26; j++){
            if(d[i][j] > min_diff[i][j]){
                cout << "N";
            }else{
                cout << "Y";
            }
            if(j == 25) cout << endl;
            else cout << " ";
        }
    }
}