#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int C = 26;
  string s; cin >> s;
  const int n = s.length();
  int d[C][C]; REP(i, C) REP(j, C) cin >> d[i][j];
  vector<int> pos[C]{};
  REP(i, n) pos[s[i] - 'a'].emplace_back(i);
  REP(alpha, C) REP(beta, C) {
    bool is_valid = true;
    int i = -1;
    for (int j : pos[beta]) {
      while (i + 1 < pos[alpha].size() && pos[alpha][i + 1] < j) ++i;
      if (i != -1 && pos[alpha][i] + d[alpha][beta] > j) {
        is_valid = false;
        break;
      }
    }
    cout << (is_valid ? 'Y' : 'N') << " \n"[beta + 1 == C];
  }
  return 0;
}