//qoj64
#include <bits/stdc++.h>
using namespace std;

const int N = 2010;
int n, m, ok[N], ans[N], cut[N], pr[N];
typedef long long ll;
ll v[N][N], sum[N], nw[N];

int main(){
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; ++ i){
		for(int j = 1; j <= m; ++ j){
			scanf("%lld", &v[i][j]);
			sum[i] += v[i][j];
		}
	}
	for(int j = 1, c = 0; j <= m; ++ j){
		for(int i = 1; i <= n; ++ i){
			if(!ok[i]){
				nw[i] += v[i][j];
				if(nw[i] * n >= sum[i]){
					++ c;
					ans[c] = j;
					++ pr[j];
					cut[c] = i;
					ok[i] = 1;
					for(int k = 1; k <= n; ++ k){
						if(!ok[k]){
							nw[k] = 0;
						}
					}
					-- j;
					break;
				}
			}
		}
	}
	for(int i = 1; i < n; ++ i){
		printf("%lld %lld\n", (ans[i]-1)*pr[ans[i]]+1, pr[ans[i]]);
		-- pr[ans[i]];
	}
	for(int i = 1; i <= n; ++ i){
		printf("%d ", cut[i]);
	}
	puts("");
}