#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}

template <class T> struct po_simple_queue {
    std::vector<T> payload;
    int front_pos = 0,back_pos=0;
    int size() const { return back_pos-front_pos; }
    bool empty() const { return 0 == size(); }
    void push(const T& t) {
		if((int)payload.size()==back_pos){
			payload.push_back(t);
		}else{
			payload[back_pos]=t;
		}
		back_pos++;
	}
    T& front() { return payload[front_pos]; }
    void pop() { front_pos++; }
	T& back(){
		return payload[back_pos-1];
	}
	void back_pop(){
		back_pos--;
	}
};

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	string S;
	cin>>S;
	int N=S.size();
	int M=26;
	vector<po_simple_queue<int>> p(M);
	rep(i,0,N) p[(int)(S[i]-'a')].push(i);
	vector<vector<int>> dist(M,vector<int>(M,INF));
	rep(i,0,N){
		int a=(int)(S[i]-'a');
		p[a].pop();
		rep(j,0,M){
			if(p[j].empty()) continue;
			chmin(dist[a][j],p[j].front()-i);
		}
	}
	rep(i,0,M){
		rep(j,0,M){
			int a;
			cin>>a;
			if(j) cout<<" ";
			cout<<(a<=dist[i][j] ? 'Y' : 'N');
		}
		cout<<"\n";
	}
}