#include<bits/stdc++.h>
using namespace std;
using ll=long long;
namespace el
{
	ll f(ll n,ll a,ll b,ll c)
	{
		if(b>=c)return f(n,a,b%c,c)+(b/c)*(n+1);
		if(a>=c)return f(n,a%c,b,c)+(a/c)*(n*(n+1)/2);
		long long m=(n*a+b)/c;
		if(m==0)return 0;
		return n*m-f(m-1,c,c-b-1,a);
	}
}
int main()
{
	int 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--)
	{
		ll k;
		cin>>k;
		if(k<=m-1)
		{
			cout<<1<<' '<<k+1<<"\n";
		}
		else if(k>=n*m-1-(n-1)+1)
		{
			cout<<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<=41;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<<1+k*besty<<' '<<1+k*bestx<<"\n";
		}
		else
		{
			ll p=n-1;
			ll lq=0,rq=m-1;
			for(int tt=1;tt<=41;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<<1+k*besty<<' '<<1+k*bestx<<"\n";
		}
	}

	return 0;
}