import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    s = str(input()); INF = pow(10,9)
    n = len(s)
    D = [list(map(int,input().split())) for _ in range(26)]

    loc_list = [[-INF,INF] for _ in range(26)]
    for i in range(n):
        t = ord(s[i]) - ord('a')
        loc_list[t].append(i)

    for p in loc_list:
        p.sort()

    #print(loc_list)

    ans = [['Y']*26 for _ in range(26)]

    for i in range(26):
        for j in range(26):
            mn = INF
            if i == j:
                for k in range(len(loc_list[i])-1):
                    dif = loc_list[i][k+1] - loc_list[i][k]
                    mn = min(mn, dif)
            else:
                for k in range(1,len(loc_list[i])-1):
                    iloc = loc_list[i][k]
                    jloc_idx = bisect.bisect_left(loc_list[j], iloc)
                    jloc = loc_list[j][jloc_idx]
                    dif = jloc - iloc
                    mn = min(mn,dif)
            #print(mn)
            

            if mn < D[i][j]:
                ans[i][j] = 'N'
    
    for ret in ans:
        print(*ret)


if __name__ == '__main__':
    main()