#include<bits/stdc++.h>
using namespace std;typedef long long ll;int n,m,q;ll k;
ll calc(int a,int b,int c,int n){//sum((ai+b)/c),0<=i<=n
	if(a>=c||b>=c)return 1ll*a/c*n*(n+1)/2+1ll*b/c*(n+1)+calc(a%c,b%c,c,n);
	if(!a)return 0;int m=(1ll*a*n+b)/c;return 1ll*m*n-calc(c,c-b-1,a,m-1);
}
ll calc(int a,int b){int k=min((ll)m-1,((ll)b*n-1)/a);return calc(a,0,b,k)+1ll*(n-1)*(m-1-k);}
void qry(int xa,int ya,int xb,int yb){
	int xn=xa+xb,yn=ya+yb;ll s=calc(xn,yn),t=min((n-1)/xn,(m-1)/yn);
	if(k>s)qry(xn,yn,xb,yb);else if(k<=s-t)qry(xa,ya,xn,yn);else k-=s-t,printf("%d %d\n",k*xn+1,k*yn+1);
}
void sol(){
	scanf("%lld",&k);if(k<m)printf("1 %d\n",k+1);
	else if(k>1ll*n*(m-1))printf("%d 1\n",k-1ll*n*(m-1)+1);
	else k-=m-1,qry(0,1,1,0);
}
int main(){scanf("%d%d%d",&n,&m,&q);while(q--)sol();}