#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
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; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	string S;
	cin >> S;
	lint N = S.size();
	vvi v(26, vi(26));
	rep(i, 26) vin(v[i]);

	lint a=0, b=0, c=0, x, y, z;
	rep(i, 26) {
		rep(j, 26) {
			a = -LINF, b = 0, c = 0;
			rep(k, N) {
				if (S[k] == 'a'+i) {
					if (i == j) {
						if (k-a < v[i][j]) {
							c = 1;
							break;
						}
						a = k;
					} else {
						a = k;
					}
				} else if (S[k] == 'a'+j) {
					if (k-a < v[i][j]) {
						c = 1;
						break;
					}
					b = k;
				}
			}
			if (c) std::cout << "N ";
			else std::cout << "Y ";
		}
		std::cout << '\n';
	}
}