#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,ax[510][510],axf[510][510],lj;
void search(int x,int y)
{
	if(x>=1&&y>=1&&x<=n-1&&y<=m)
	{
		axf[x][y]=1;
		if(axf[x+1][y]!=-1&&ax[x+1][y]<ax[x][y])
			search(x+1,y);
		if(axf[x-1][y]!=-1&&ax[x-1][y]<ax[x][y])
			search(x-1,y);
		if(axf[x][y+1]!=-1&&ax[x][y+1]<ax[x][y])
			search(x,y+1);
		if(axf[x][y-1]!=-1&&ax[x][y-1]<ax[x][y])
			search(x,y-1);
		axf[x][y]=-1;
	}
	return;
}
int main()
{
	freopen("flow.in","r",stdin);
	freopen("flow.out","w",stdout);
	cin>>n>>m;
	for(int i=0;i<=n-1;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>ax[i][j];
		}
	}
	for(int i=1;i<=m;i++)
	{
		if(ax[0][i]>ax[1][i])
			search(1,i);
	}
	for(int i=1;i<=m;i++)
	{
		if(axf[n-1][i]==0)
			lj++;
	}
	cout<<"0"<<endl<<lj<<endl;
	return 0;
}
/*
13 4
32 37 75 16 64 33 79 97 22 2 99 100 41
4 2 2 4

326
*/