import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum V = 26; void main() { try { for (; ; ) { const S = readToken; const L = cast(int)(S.length); auto D = new int[][](V, V); foreach (u; 0 .. V) foreach (v; 0 .. V) { D[u][v] = readInt; } auto ans = new int[][](V, V); foreach (u; 0 .. V) foreach (v; 0 .. V) { ans[u][v] = int.max; } auto app = new int[V]; app[] = L; foreach_reverse (i; 0 .. L) { const u = S[i] - 'a'; foreach (v; 0 .. V) if (app[v] < L) { chmin(ans[u][v], app[v] - i); } app[u] = i; } foreach (u; 0 .. V) { foreach (v; 0 .. V) { if (v) write(" "); write((D[u][v] <= ans[u][v]) ? "Y" : "N"); } writeln; } debug { writeln("========"); } } } catch (EOFException e) { } }