#include <bits/stdc++.h> 
using namespace std;
#define ll long long
const int N = 510;
int n,m;
int a[N][N];
bool v[N][N];
vector<int>s[N];
void sou(int x,int y){
    if(v[x][y])return;
    v[x][y] = 1;
    if(x > 1 && a[x-1][y] < a[x][y])sou(x-1,y);
    if(x < n && a[x+1][y] < a[x][y])sou(x+1,y);
    if(y > 1 && a[x][y-1] < a[x][y])sou(x,y-1);
    if(y < m && a[x][y+1] < a[x][y])sou(x,y+1);
}
bool check(){
    for(int i = 1;i <= m;i++){
        if(v[n][i] == 0)return 1;
    }
    return 0;
}
int main(){
    freopen("flow.in","r",stdin);
    freopen("flow.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++)
        for(int j = 1;j <= m;j++)scanf("%d",&a[i][j]);
    for(int i = 1;i <= m;i++)sou(1,i);
    if(check()){
        printf("0\n");
        int ans = 0;
        for(int i = 1;i <= m;i++)
            if(v[n][i] == 0)ans++;
        printf("%d\n",ans);
        return 0; 
    }
    if(n == 1){
        int ans = 0;
        for(int i = 1;i <= m;i++){
            if(a[1][i] >= a[1][i-1] && a[1][i] >= a[1][i+1])ans++; 
        }
        printf("1\n%d\n",ans);
        return 0;
    } 
    cout<<1<<endl<<34<<endl;
    
    
    return 0;
    
}