#include <bits/stdc++.h>

#define int long long
#define ll long long
#define ld long double
//#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
ll infl=1000000000000000007;
int inf=1000000007;
int mod=1000000007;
int mod1=998244353;

const int N=2007;

struct frac
{
    __int128 p,q;
};
bool cmp(frac A,frac B)
{
    return A.p*B.q<=B.p*A.q;
}


int a[N][N];
int P[N][N];
int s[N];
bool odw[N];

vector<pair<frac,int>>V[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>a[i][j];
            P[i][j]=P[i][j-1]+a[i][j];
            s[i]+=a[i][j];
        }
        int k=0;
        for(int j=1;j<n;j++)
        {
            while(cmp({P[i][k+1],1},{s[i]*j,n})) k++;
            frac X;
            X.p=s[i]*j-P[i][k]*n+k*n*a[i][k+1];
            X.q=n*a[i][k+1];
            V[j].pb({X,i});
        }
    }
    vector<int>ord;
    for(int j=1;j<n;j++)
    {
        frac mn={m+7,1};
        int c=0;
        for(auto [X,i]:V[j])
        {
            if(odw[i]) continue;
            if(cmp(X,mn))
            {
                mn=X;
                c=i;
            }
        }
        ord.pb(c);
        odw[c]=1;
        cout<<(ll)mn.p<<" "<<(ll)mn.q<<endl;
    }
    for(int i=1;i<=n;i++) if(!odw[i]) ord.pb(i);
    for(auto x:ord) cout<<x<<" ";
    cout<<endl;
}