#include <iostream>
#include <cstring>
using namespace std;
int map[251][251],m,n,ans,a,b,num[62501],k;
int dx[4]= {-1,0,1,0};
int dy[4]= {0,1,0,-1};
void bfs(int x,int y) {//其实是dfs
	for (int i=0; i<4; i++)
		if((x+dx[i]>=0)&&(x+dx[i]<m)&&(y+dy[i]>=0)&&(y+dy[i]<n)&&(map[x+dx[i]][y+dy[i]])) {
			map[x+dx[i]][y+dy[i]]=0;
			k++;
			bfs(x+dx[i],y+dy[i]);
		}
}
int main() {
	while(cin>>n>>m&&n!=0&&m!=0) {
		ans=0;
		memset(map,0,sizeof(map));//一定要加
		memset(num,0,sizeof(num));
		for(int i=0; i<m; i++)
			for(int j=0; j<n; j++) {
				cin>>map[i][j];
			}
		for(int i=0; i<m; i++)
			for(int j=0; j<n; j++)
				if(map[i][j]) {
					map[i][j]=0;
					bfs(i,j);
					ans++;
					num[k]++;//当前大小的计数器++
					k=0;
				}
		cout<<ans<<endl;
		for(int i=0;i<=62500;i++)if(num[i]!=0)cout<<i+1<<' '<<num[i]<<endl;
	}
}
//以下是本人打的，真的改不出来了！！！ 
/*#include<iostream>
#include<cstring>
using namespace std;
int n,m,ans;
int a[300][300],tong[90000];
int dx[5]={0,-1,0,1,0};
int dy[5]={0,0,1,0,-1};
int ji;
void dfs(int x,int y){
	for(int i=1;i<=4;i++)
		if((x+dx[i]>=0)&&(x+dx[i]<m)&&(y+dy[i]>=0)&&(y+dy[i]<n)&&(a[x+dx[i]][y+dy[i]])){
			a[x+dx[i]][y+dy[i]]=0;
			ji++;
			dfs(x+dx[i],y+dy[i]);
		}
}
int main(){
	
	while(cin>>n>>m&&n&&m){
		ans=0;
		memset(a,0,sizeof(a));
		memset(tong,0,sizeof(tong));
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				cin>>a[i][j];
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				if(a[i][j]==1){
					a[i][j]=0;
					dfs(i,j);
					ans++;
					tong[ji]++;
					ji=0;
				}
		cout<<ans<<endl;
		for(int i=1;i<=90000;i++)
			if(tong[i])
				cout<<i<<" "<<tong[i]<<endl;
		cin>>n>>m;
	}
	return 0;
}*/