#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;

int n, m1, m2;
char s[MAXN], t[MAXN];

void solve() {
    scanf("%d %d %d", &n, &m1, &m2);
    for (int i = 1; i <= n; ++i) {
        scanf("%s", s + 1);
        scanf("%s", t + 1);
        int a = 0, b = 0;
        for (int j = 1; j <= m1; ++j) {
            a += (s[j] == '-');
        }
        for (int j = 1; j <= m2; ++j) {
            b += (t[j] == '*');
        }
        if (b && a) {
            puts("N");
            return;
        }
    }
    puts("Y");
}

int main() {
    solve();
    return 0;
}