#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
#define sgn(x) ((x)&1?-1:1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
    int x=0,w=1; char c=getchar(); 
    while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
    while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
    return x*w;
}

const int N=2009;

int n,l,v[N][N],p[N],vst[N];
struct frac {
    int a,b;
    frac(int _a=0,int _b=1) {a=_a,b=_b;}
} x[N][N],y[N];
bool operator < (const frac &x,const frac &y) {
    return 1.*x.a/x.b<1.*y.a/y.b;
}
bool operator > (const frac &x,const frac &y) {
    return 1.*x.a/x.b>1.*y.a/y.b;
}
frac operator + (const frac &x,const frac &y) {
    int c=x.b/__gcd(x.b,y.b)*y.b;
    return frac(c/x.b*x.a+c/y.b*y.a,c);
}
frac operator - (const frac &x,const frac &y) {
    int c=x.b/__gcd(x.b,y.b)*y.b;
    return frac(c/x.b*x.a-c/y.b*y.a,c);
}
frac operator / (const frac &x,const int &a) {
    if(x.a==0) return x;
    int p=x.b*a, g=__gcd(x.a,p);
    return frac(x.a/g,x.b*a/g);
}
frac operator * (const frac &x,const int &a) {
    int p=x.a*a, g=__gcd(x.b,p);
    return frac(x.a*a/g,x.b/g);
}

signed main() {
    n=read(), l=read();
    rep(i,1,n) {
        int sum=0;
        rep(j,1,l) v[i][j]=read(), sum+=v[i][j];
        frac p(sum,n);
        int pos=1; frac rem(1,1);
        rep(j,1,n) {
            frac g=p;
            while(1) {
                frac q=rem*v[i][pos];
                if(q<g) g=g-q, pos++, rem=frac(1,1);
                else {
                    frac u=g/v[i][pos];
                    rem=rem-u, x[i][j]=frac(pos,1)-rem;
                    break;
                }
            }
        }
    }
    rep(j,1,n) {
        int pos=0;
        rep(i,1,n) if(!vst[i]) {
            if(pos==0) pos=i;
            else if(x[i][j]<x[pos][j]) pos=i;
        } vst[pos]=1;
        y[j]=x[pos][j];
        p[j]=pos;
    }
    rep(j,1,n-1) printf("%lld %lld\n",y[j].a,y[j].b);
    rep(j,1,n) printf("%lld ",p[j]); puts("");
    return 0;
}