#include<bits/stdc++.h>

#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define ll long long
#define pb push_back
using namespace std;

const int N=1e6+5;
vector<ll> x(N);
int n,m;
ll t;
pair<int,int> ans;
void solve(int i,int j){
    x[i]=x[i-1]+j-1;
    //printf("%i %i: %lld %i %i %lld\n",i,j,x[i],n,m,t);
    ll k=n/i;
    ll sm=(ll)n*m;
    sm-=x[i]*k;
    sm-=k*(k-1)/2*j*i;
    ll ost=n%i;
    sm-=ost*(m-j*k);
    sm-=x[ost];
    //printf("%lld!\n",sm);
    if(sm<t){
        solve(i+1,j);
        return;
    }
    int imam=min((n+1)/i,(m+1)/j);
    ll over=sm-t;
    if(over<=imam-1){
        int ind=imam-over;
        ans={i*ind,j*ind};
        return;
    }
    solve(i,j+1);
}
int main(){
    int q;
    scanf("%i %i %i",&n,&m,&q);
    n--;m--;
    for(int i=0;i<q;i++){
        scanf("%i",&t);
        if(t<=m){
            printf("%i %i\n",1,1+t);
            continue;
        }
        t-=m;
        ll kraj=n*(ll)(m+1)-t;
        if(kraj<n){
            printf("%i %i\n",n-kraj+1,1);
            continue;
        }
        solve(1,1);
        printf("%i %i\n",ans.f+1,ans.s+1);
    }
}