#include<bits/stdc++.h>
using namespace std;
using ll=__int128;
namespace el
{
	typedef long long ll;
	struct ifo{
		ll f,g,h;
		ifo(ll _f,ll _g,ll _h):f(_f),g(_g),h(_h){}
	};
	ll S1(ll n){
		return n*(n+1)/2;
	}
	ll S2(ll n){
		return n*(n+1)*(2*n+1)/6;
	}
	ifo Get(ll n,ll A,ll B,ll C){
		if (!A){
			ll t=B/C;
			ll f=(n+1)*t;
			ll g=S1(n)*t;
			ll h=(n+1)*t*t;
			return ifo(f,g,h);
		}
		else if (A>=C || B>=C){
			ifo Nx=Get(n,A%C,B%C,C);
			ll p=A/C,q=B/C;
			ll f=(p*S1(n)+q*(n+1)+Nx.f);
			ll g=(p*S2(n)+q*S1(n)+Nx.g);
			ll h=(p*p*S2(n)+2*p*q*S1(n)
			+(n+1)*q*q+2*p*Nx.g+2*q*Nx.f+Nx.h);
			return ifo(f,g,h);
		}
		else{
			ll m=(A*n+B)/C;
			ifo Nx=Get(m-1,C,C-B-1,A);
			ll f=((n*m-Nx.f));
			ll g=((2*m*S1(n)-Nx.h-Nx.f)/2);
			ll h=((2*n*S1(m-1)+n*m-2*Nx.g-Nx.f));
			return ifo(f,g,h);
		}
	}
	ll f(ll n,ll a,ll b,ll c)
	{
		return Get(n,a,b,c).f; 
	}
}
ll gcd(ll x,ll y)
{
	if(y==0)return x;
	return gcd(y,x%y);
}
int main()
{
	long long n,m,T;
	cin>>n>>m>>T;

	auto solve=[&](ll x,ll y)
	{
		ll g=gcd(x,y);
		x/=g;y/=g;
		if(y*(m-1)<=(n-1)*x)
		{
			ll tmp=el::f(m-1,y,0,x)+m-1;
			ll cc=min((m-1)/x,(n-1)/y);
			return tmp-cc;
		}
		else
		{
			ll tmp=el::f(n-1,x,0,y)+n;
			return n*m-tmp;
		}
	};
//	cerr<<solve(3,2)<<endl;
	while(T--)
	{
		long long k;
		cin>>k;
		if(k<=m-1)
		{
			cout<<1<<' '<<(long long)(k+1)<<"\n";
		}
		else if(k>=n*m-1-(n-1)+1)
		{
			cout<<(long long)(k-(n*m-1-(n-1))+1)<<' '<<1<<"\n";
		}
		else if(k<=n*m/2)
		{
			ll lp=0,rp=n-1;
			ll q=m-1;
			for(int tt=1;tt<=61;tt++)
			{
//				cerr<<lp<<' '<<rp<<' '<<q<<endl;
				ll mp=(lp+rp);
				ll mq=q*2;
//				cerr<<mp<<' '<<mq<<' '<<solve(mp,mq)<<endl;
				if(solve(mq,mp)>=k)rp=mp,lp*=2;
				else lp=mp,rp*=2;
				q=mq;
			}
			ll bestx=0,besty=0;
			for(int i=1;i<=m-1;i++)
			{
				ll y=(i*lp+q-1)/q,x=i;
				if(bestx==0 or x*besty-y*bestx>0)bestx=x,besty=y;
			}
			ll g=gcd(bestx,besty);
			bestx/=g;besty/=g;
			ll cntr=solve(bestx,besty);
			k-=cntr;
			cout<<(long long)(1+k*besty)<<' '<<(long long)(1+k*bestx)<<"\n";
		}
		else
		{
			ll p=n-1;
			ll lq=0,rq=m-1;
			for(int tt=1;tt<=61;tt++)
			{
				ll mp=p*2;
				ll mq=(lq+rq);
				if(solve(mq,mp)>=k)lq=mq,rq*=2;
				else rq=mq,lq*=2;
				p=mp;
			}
//			cerr<<p<<' '<<rq<<endl;
//			cerr<<1.0*p/rq<<endl;
			ll bestx=0,besty=0;
			for(int i=1;i<=n-1;i++)
			{
				ll y=i,x=rq*i/p;
				if(bestx==0 or x*besty-y*bestx>0)bestx=x,besty=y;
			}
			ll g=gcd(bestx,besty);
			bestx/=g;besty/=g;
			ll cntr=solve(bestx,besty);
//			cerr<<bestx<<' '<<besty<<' '<<cntr<<endl;
			k-=cntr;
			cout<<(long long)(1+k*besty)<<' '<<(long long)(1+k*bestx)<<"\n";
		}
	}

	return 0;
}