#include <stdio.h>

int N, M, x[1024][1024];

void check (int i, int j)
{
    int st = j - 1, dr = j + 1;
    while (st > 0 && dr <= M)
    {
        if (x[i][st] != x[i][dr])
            return;
        st --;
        dr ++;
    }
    return ;
}

int main ()
{
    int i, j;

    freopen ("dreptpal.in", "r", stdin);
    freopen ("dreptpal.out", "w", stdout);

    scanf ("%d%d", &N, &M);
    for (i = 1; i <= N; i ++)
        for (j = 1; j <= M; j ++)
            scanf ("%d", &x[i][j]);
    for (i = 1; i <= N; i ++)
        for (j = 1; j <= M; j ++)
            check (i, j);

    printf ("Neatza pozdy :P");
    return 0;
}