#include using namespace std; using ll = long long; using uint = unsigned int; using ull = unsigned long long; #define rep(i,n) for(int i=0;i=0;i--) #define per1(i,n) for(int i=int(n);i>0;i--) #define all(c) c.begin(),c.end() #define si(x) int(x.size()) #define pb push_back #define eb emplace_back #define fs first #define sc second template using V = vector; template using VV = vector>; template bool chmax(T& x, U y){ if(x bool chmin(T& x, U y){ if(y void mkuni(V& v){sort(all(v));v.erase(unique(all(v)),v.end());} template int lwb(const V& v, const T& a){return lower_bound(all(v),a) - v.begin();} template V Vec(size_t a) { return V(a); } template auto Vec(size_t a, Ts... ts) { return V(ts...))>(a, Vec(ts...)); } template ostream& operator<<(ostream& o,const pair &p){ return o<<"("< ostream& operator<<(ostream& o,const vector &vc){ o<<"{"; for(const T& v:vc) o< D divFloor(D a, D b){ return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0); } template D divCeil(D a, D b) { return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0); } int main(){ cin.tie(0); ios::sync_with_stdio(false); //DON'T USE scanf/printf/puts !! cout << fixed << setprecision(20); string s; cin >> s; int N = si(s); const int A = 26; VV a(A,V(N+1)); rep(i,N){ rep(c,A) a[c][i+1] = a[c][i]; a[s[i]-'a'][i+1]++; } VV D(A,V(A)); rep(i,A) rep(j,A) cin >> D[i][j]; VV ans(A,V(A,true)); rep(i,N){ int c = s[i]-'a'; rep(d,A){ int j = min(i + D[c][d], N); if(a[d][j]-a[d][i+1] > 0) ans[c][d] = false; } } rep(i,26){ rep(j,26) cout << (ans[i][j] ? 'Y' : 'N') << " "; cout << endl; } }