// Arup Guha
// 6/8/2026
// Solution to Kattis Problem: Laegdy fir landinu
// https://open.kattis.com/problems/laegdyfirlandinu

using namespace std;
#include <bits/stdc++.h>

// Valid directions of movement for adjacent squares for this problem.
const vector<int> DR = {-1,0,0,1};
const vector<int> DC = {0,-1,1,0};

int hasLow(vector<vector<int>>& grid);

int main() {

    int r, c;
    cin >> r >> c;

    // Read in the grid.
    vector<vector<int>> grid(r);
    for (int i=0; i<r; i++) {
        for (int j=0; j<c; j++) {
            int tmp;
            cin >> tmp;
            grid[i].push_back(tmp);
        }
    }

    // Solve it and output.
    int res = hasLow(grid);
    if (res)
        cout << "Jebb" << endl;
    else
        cout << "Neibb" << endl;

    return 0;
}

// Returns 1 if there's a low square, 0 otherwise.
int hasLow(vector<vector<int>>& grid) {

    // Skip first, last row. Same for columns.
    for (int i=1; i<grid.size()-1; i++) {
        for (int j=1; j<grid[i].size()-1; j++) {

            int cnt = 0;

            // Go to neighbors.
            for (int z=0; z<DR.size(); z++) {
                int nR = i + DR[z];
                int nC = j + DC[z];

                // Count it if it's lower.
                if (grid[i][j] < grid[nR][nC]) cnt++;
            }

            // Found a low.
            if (cnt == 4) return 1;
        }
    }

    // We never found a low square.
    return 0;
}