#include <bits/stdc++.h>
#define pr pair<int,int>
using namespace std;
const int N = 500 + 10;
int n, m, a[N][N], vis[N][N], ck[N][N], f[N][N];
int fx[10 + 10][10 + 10] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
queue<pr> p;
int read() {
    int s = 0, w = 1;
    char ch = getchar();

    while (ch < '0' || ch > '9') {
        if (ch == '-')
            w = -1;

        ch = getchar();
    }

    while (ch >= '0' && ch <= '9')
        s = s * 10 + (ch - '0'), ch = getchar();

    return s * w;
}
void work(int j) {
    p.push(make_pair(1, j));

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            vis[i][j] = 0;

    vis[1][j] = 1;

    while (!p.empty()) {
        pr u = p.front();
        p.pop();

        if (u.first == n)
            ck[j][u.second] = 1;

        for (int i = 0; i < 4; ++i) {
            int xx = u.first + fx[i][0];
            int yy = u.second + fx[i][1];

            if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && !vis[xx][yy] && a[u.first][u.second] > a[xx][yy]) {
                vis[xx][yy] = 1;
                p.push(make_pair(xx, yy));
            }
        }
    }
}
int main() {
    n = read(), m = read();

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            a[i][j] = read();

    for (int i = 1; i <= m; ++i)
        work(i);

    memset(f, 0x3f, sizeof(f));
    f[0][0] = 0;

    for (int i = 0; i < m; ++i)
        for (int j = 0; j <= m; ++j) {
            f[i + 1][j] = min(f[i + 1][j], f[i][j]);
            int p = j;

            while (p + 1 <= m && ck[i + 1][p + 1])
                p++;

            f[i + 1][p] = min(f[i + 1][p], f[i][j] + 1);
        }

    if (f[m][m] < f[m + 1][m + 1])
        printf("1\n%d", f[m][m]);
    else {
        printf("0\n");
        int ans = 0;

        for (int i = 1; i <= m; ++i) {
            bool flag = false;

            for (int j = 1; j <= m; ++j)
                flag |= ck[j][i];

            if (!flag)
                ans++;
        }

        printf("%d", ans);
    }

    return 0;
}