from bisect import bisect_left
from itertools import product
from string import ascii_lowercase


def main():
    S = list(input())
    distances = [list(map(int, input().split())) for _ in range(26)]

    letter_idxs = {letter: [] for letter in ascii_lowercase}
    for idx, letter in enumerate(S):
        letter_idxs[letter].append(idx)

    is_satisfied = [[False for _ in range(26)] for _ in range(26)]
    for alpha, beta in product(ascii_lowercase, repeat=2):
        for alpha_idx in letter_idxs[alpha]:
            _beta_idx = bisect_left(letter_idxs[beta], alpha_idx + 1)
            if _beta_idx == len(letter_idxs[beta]):
                continue
            beta_idx = letter_idxs[beta][_beta_idx]
            if alpha_idx + \
                    distances[ord(alpha) - ord("a")][ord(beta) - ord("a")] > beta_idx:
                break
        else:
            is_satisfied[ord(alpha) - ord("a")][ord(beta) - ord("a")] = True

    for row in is_satisfied:
        output = []
        for elm in row:
            if elm:
                output.append("Y")
            else:
                output.append("N")
        print(*output)


if __name__ == "__main__":
    main()