#include<bits/stdc++.h>
using namespace std;
queue<int>na,nv;
int main()
{
int n,m,i,x=0,y,k;
cin>>n>>m>>k;
for(i=1;i<=n;i++) na.push(i);
for(i=1;i<=m;i++) nv.push(i);
for(i=1;i<=k;i++)//while(!q.empty())
{
x=na.front();
y=nv.front();//取队首元素
cout<<x<<" "<<y<<endl;
na.pop();//删除队首元素 放到队尾 
nv.pop();
na.push(x);
nv.push(y);
}
}

#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> >q; //优先队列，greater 从小到大  ；less从大到小
int main()
{
    int a[100],n,x,y,z;
    int i=1;
    while(cin>>a[i])
    {
    q.push(a[i]);
    i++;
}
    while(!q.empty()) 
{
x=q.top();
cout<<x<<" ";
q.pop();
}

    return 0;
}