#include using namespace std; typedef pair pii; typedef long long ll; const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f; ll res; int n, m, cnt, w[N]; char s[210][210]; int main() { cin >> n >> m; for (int i = 1; i < n + 1; i++) scanf("%s", s[i] + 1); for (int i = 1; i < n + 1; i++) for (int j = 1; j < m + 1; j++) if (s[i][j] == 'y') if (s[i][j - 1] == 'i') s[i][j] = s[i][j - 4] ^ 32; else s[i][j] ^= 32 * (s[i][j - 1] == '9' && (j == 2 || s[i][j - 2] != 'Y')); for (int i = 1; i < n + 1; i++) puts(s[i] + 1); return 0; }