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

int n,k;
int stk[150][150];
int tp[150];
int sz[150];
int sum[150];

int tl[150],tr[150];
int rest[150];

vector<pair<int,int>> ans;

//#define DEBUG 1

#ifdef DEBUG
void display(){
	cerr << "---------" << endl;
	for (int i=1;i<=k;i++){
		for (int j=1;j<=sz[i];j++){
			cerr << stk[i][j] << " ";	
		}
		cerr << endl;
	}
	cerr << "--------" << endl;
}
#endif

void check(){
	for (int i=1;i<=k;i++){
		for (int j=1;j<=tp[i];j++){
			assert(stk[i][j]==tl[i]+j-1);	
		}
	}
}

void answer(){
	for (auto [x,y]:ans) cout << x << " " << y << "\n";
	cout << 0 << " " << 0 << "\n";
	check();
	#ifdef DEBUG
		display();
	#endif
	exit(0);	
}

bool move(int x,int y){
	if (x==y) return false;
	if (tp[x]==0) return false;
	if (tp[y]==sz[y]) return false;
	ans.emplace_back(x,y);
	stk[y][++tp[y]]=stk[x][tp[x]];
	stk[x][tp[x]--]=0;
	return true;	
}
pair<int,int> find(int x){
	for (int i=1;i<=k;i++){
		for (int j=1;j<=tp[i];j++) if (stk[i][j]==x) return make_pair(i,j);	
	}
	return make_pair(0,0);
}

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n >> k;
	for (int i=1;i<=k;i++){
		cin >> sz[i];
		for (int j=1;j<=sz[i];j++){
			cin >> stk[i][j];
			if (stk[i][j]!=0) tp[i]=j;
		}
	}
	
	int pos=1;
	for (int i=1;i<=k;i++) if (sz[i]>sz[pos]) pos=i;
	for (int i=1;i<=k;i++){
		while (move(pos,i));
	}
	#ifdef DEBUG
	display();
	#endif
	
	for (int i=1;i<=k;i++) sum[i]=sum[i-1]+sz[i];
	int mx=0;
	for (int i=1;i<=k;i++){
		tl[i]=1;
		tr[i]=0;	
	}
	for (int i=1;i<=k;i++){
		tl[i]=sum[i-1]+1;
		tr[i]=sum[i];
		if (tr[i]>=n) tr[i]=n;
		if (tr[i]==n){
			mx=i;
			break;	
		}
	}
	for (int i=1;i<=k;i++) rest[i]=sz[i]-(tr[i]-tl[i]+1);
	
	#ifdef DEBUG
		cerr << "-----tl,tr,rest-" << endl;
		for (int i=1;i<=k;i++) cerr << tl[i] << " " << tr[i] << " " << rest[i] << endl;
		cerr << "------" << endl;
	#endif
	
	for (int i=1;i<=mx;i++){
		if (i==pos) continue;
		for (int x=tl[i];x<=tr[i];x++){
			int xp=x-tl[i]+1;
			{
				auto [loci,locj]=find(x);
				#ifdef DEBUG
					cerr << "li,lj : " << loci << " " << locj << endl;
				#endif
				if (loci!=i){
					if (tp[i]==sz[i]) move(i,pos);
					while (tp[loci]>locj) move(loci,pos);
					move(loci,i);
					while (move(pos,loci));
				}
			}
			#ifdef DEBUG
			cerr << "x,xp : " << x << " " << xp << endl;
			display();
			#endif
			{
				int sec=0;
				for (int cc=1;cc<=k;cc++) if (cc!=i && cc!=pos){sec=cc;break;}
				#ifdef DEBUG
					cerr << "sec : " << sec << endl;
				#endif
				auto [loci,locj]=find(x);
				assert(loci==i);
				int flag=0;
				if (move(sec,pos)) flag=1;
				while (tp[loci]>locj) move(loci,pos);
				move(loci,sec);
				while (tp[loci]>=xp) move(loci,pos);
				move(sec,loci);
				while (tp[pos]>flag && move(pos,loci));
				move(pos,sec);
			}
			#ifdef DEBUG
			cerr << "x,xp : " << x << " " << xp << endl;
			display();
			#endif
		}
	}
	if (pos>mx) answer();
	for (int i=1;i<=k;i++){
		if (i==pos) continue;
		while (tp[i]>tr[i]-tl[i]+1) move(i,pos);	
	}
	#ifdef DEBUG
	cerr << "----------after-------" << endl;
	display();
	#endif
	vector<int> lis1;
	vector<int> lis2;
	for (int i=1;i<=k;i++){
		if (i==pos) continue;
		if (tp[i]==sz[i]) lis1.push_back(i);
		else lis2.push_back(i);
	}
	#ifdef DEBUG
	cerr << "lis1 : ";
	for (auto x:lis1) cerr << x << " ";
	cerr << endl;
	cerr << "lis2 : ";
	for (auto x:lis2) cerr << x << " ";
	cerr << endl;
	#endif
	if (lis1.size()){
		#ifdef DEBUG
			cerr << "case 1" << endl;
		#endif
		int sec=lis1[0];
		#ifdef DEBUG
			cerr << "sec : " << sec << endl;
		#endif
		for (int x=tl[pos];x<=tr[pos];x++){
			int xp=x-tl[pos]+1;
			auto [loci,locj]=find(x);
			assert(loci==pos);
			
			#ifdef DEBUG
			cerr << "x,xp : " << x << " " << xp << endl;
			cerr << "loci,locj : " << loci << " " << locj << endl;
			#endif
			
			move(sec,lis2[0]);
			int now=0;
			while (tp[pos]>locj){
				while (!move(pos,lis2[now])) now++;
			}
			#ifdef DEBUG
			display();
			#endif
			move(pos,sec);
			while (tp[pos]>=xp){
				while (!move(pos,lis2[now])) now++;
			}
			#ifdef DEBUG
			display();
			#endif
			move(sec,pos);
			for (int i=(int)lis2.size()-1;i>=0;i--){
				int tmp=lis2[i];
				while (tp[tmp]>tr[tmp]-tl[tmp]+1+(i==0) && move(tmp,pos));
			}
			move(lis2[0],sec);
			#ifdef DEBUG
			display();
			#endif
		}
		answer();
	}
	else{
		#ifdef DEBUG
			cerr << "case 2" << endl;
		#endif
		int mn=lis2[0];
		for (auto tmp:lis2) if (rest[tmp]<rest[mn]) mn=tmp;
		
		int szy=rest[mn];
		int szx=-rest[mn];
		for (auto tmp:lis2) szx+=rest[tmp];
		 
		for (int x=tl[pos];x<=tr[pos];x++){
			int xp=x-tl[pos]+1;
			{
				auto [loci,locj]=find(x);
				if (tp[pos]-locj<szy-1 && locj-xp>szx){
					
					for (;tp[pos]>=locj;) move(pos,mn);
					int now=0;
					for (int cc=1;cc<=szx;cc++){
						while (lis2[now]==mn || !move(pos,lis2[now])) now++;	
					}
					for (;tp[pos]>=xp;) move(pos,mn);
					for (;tp[mn]>tr[mn]-tl[mn]+1;) move(mn,pos);
					for (auto tmp:lis2){
						while (tp[tmp]>tr[tmp]-tl[tmp]+1) move(tmp,pos);	
					}
				}
			}
			{
				auto [loci,locj]=find(x);
				if (tp[pos]-locj>=szy-1){
					int now=0;
					for (;tp[pos]-locj>szy-1;){
						while (lis2[now]==mn || !move(pos,lis2[now])) now++;	
					}
					for (int cc=1;cc<=szy;cc++) move(pos,mn);
					for (;tp[pos]>=xp;){
						while (lis2[now]==mn || !move(pos,lis2[now])) now++;	
					}
					for (int cc=1;cc<=szy;cc++) move(mn,pos);
					for (auto tmp:lis2){
						while (tp[tmp]>tr[tmp]-tl[tmp]+1) move(tmp,pos);	
					}
				}
				else if (locj-xp<=szx){
					for (;tp[pos]>=locj;) move(pos,mn);
					int now=0;
					for (;tp[pos]>=xp;){
						while (lis2[now]==mn || !move(pos,lis2[now])) now++;	
					}
					for (;tp[mn]>tr[mn]-tl[mn]+1;) move(mn,pos);
					for (auto tmp:lis2){
						while (tp[tmp]>tr[tmp]-tl[tmp]+1) move(tmp,pos);	
					}
				}
			}
		}
	}
	answer();
	return 0;	
}