#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s; cin >> s;
	vector<vector<int>> d(26, vector<int>(26));
	vector<vector<bool>> ans(26, vector<bool>(26, true));

	rep(i, 26)rep(j, 26)cin >> d[i][j];
	vector<int>pos(26, -INF);
	rep(i, s.size()) {
		int i2 = s[i] - 'a';
		rep(j, 26) if (d[j][i2] > (i - pos[j])) ans[j][i2] = false;
		pos[i2] = i;
	}
	rep(i, 26) {
		rep(j, 26) {
			if (ans[i][j])cout << "Y" << " ";
			else cout << "N" << " ";
		}
		cout << endl;
	}
	return 0;
}