/* -*- coding: utf-8 -*-
 *
 * 2000.cc:  No.2000 Distanced Characters - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int M = 26;
const int INF = 1 << 30;

/* typedef */

/* global variables */

char s[MAX_N + 4];
int ds[M][M], ps[M];
bool ys[M][M];

/* subroutines */

/* main */

int main() {
  scanf("%s", s);
  int n = strlen(s);

  for (int i = 0; i < M; i++)
    for (int j = 0; j < M; j++) scanf("%d", ds[i] + j);

  fill(ps, ps + M, -INF);
  for (int i = 0; i < n; i++) {
    int si = s[i] - 'a';
    for (int j = 0; j < M; j++)
      if (ps[j] + ds[j][si] > i) ys[j][si] = true;
    ps[si] = i;
  }

  for (int i = 0; i < M; i++)
    for (int j = 0; j < M; j++)
      printf("%c%c", ys[i][j] ? 'N' : 'Y', (j + 1 < M) ? ' ' : '\n');

  return 0;
}