#include<bits/stdc++.h>

using namespace std;

#define MAXN 510

const int dx[] = {,,-,};

const int dy[] = {-,,,};

int n,m,len;

int a[MAXN][MAXN];

pair<int,int> range[MAXN];

bool mark[MAXN];

bool visited[MAXN][MAXN];

template <typename T> inline void read(T &x)

{

    T f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

inline bool valid(int x,int y)

{

        return x >=  && x <= n && y >=  && y <= m;

}

inline pair<int,int> bfs(int x,int y)

{

        int l =  , r = ;

        queue< pair<int,int> > q;

        memset(visited,false,sizeof(visited));

        q.push(make_pair(x,y));

        visited[x][y] = true;

        while (!q.empty())

        {

                pair<int,int> cur = q.front();

                q.pop();

                for (int i = ; i < ; i++)

                {

                        int x = cur.first + dx[i] , y = cur.second + dy[i];

                        if (valid(x,y) && a[x][y] < a[cur.first][cur.second] && !visited[x][y])

                        {

                                visited[x][y] = true;

                                q.push(make_pair(x,y));

                        }

                }

        }

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

        {

                if (visited[n][i])

                {

                        mark[i] = true;

                        if (!l) l = r = i;

                        else r++;

                }

        }

        return make_pair(l,r);

}

inline bool cmp(pair<int,int> a,pair<int,int> b)

{

        if (a.first != b.first) return a.first < b.first;

        else return a.second > b.second;

}

int main()

{

        read(n); read(m);

        for (int i = ; i <= n; i++)

        {

                for (int j = ; j <= m; j++)

                {

                        read(a[i][j]);

                }

        }

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

        {

                pair<int,int> tmp = bfs(,i);

                if (tmp.first) range[++len] = tmp;

        }

        int cnt = ;

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

        {

                if (mark[i])

                        cnt++;

        }

        if (cnt < m)

        {

                printf("0\n");

                printf("%d\n",m - cnt);

                return ;

        }

        sort(range + ,range + len + ,cmp);

        int r = range[].second , ans =  , pos = ;

        while (r < m)

        {

                int mx = r;

                while (pos <= len && range[pos].first <= r + )

                {

                        mx = max(mx,range[pos].second);

                        pos++;

                }

                r = mx;

                ans++;

        }

        printf("1\n%d\n",ans);

        return ;

}