#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <utility>
#include <map>
#define ll long long int
const ll mod=1e9+7;
using namespace std;
/*
? Did I test edge cases? (Empty, min/max, 1-element, same elements, etc.)
? Did I reread the full prompt to recheck constraints?
? Does my code handle ties, negatives, zeroes, or duplicates?
? Am I brute-forcing something unnecessarily?
? Am I assuming things not in the problem?
Have I defined all state variables explicitly?
Do I know what each transition costs?
Have I written 2 edge-case scenarios by hand?
*/
int main(){
//cin.tie(0)->sync_with_stdio(false);
int n,sub;
cin>>sub>>n;
int a[n][n];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cin>>a[i][j];
}
for(int i=0;i<n;i++)
cout<<a[0][i]<<" ";
cout<<endl;
for(int i=1;i<n;i++)
{
cout<<i<<" "<<i+1<<endl;
}
return 0;
}
