#include <iostream>

using namespace std;

void zamiana (long long int dni, long long int *B, long long int k)
{
    long long int s=0, p=0;
    while (!(B[s]<dni&&B[s+1]>=dni))
    {
        s=(p+k)/2;
        if (B[s]<dni) p=s;
        else k=s;
    }
    cout<<dni-B[s]<<" "<<s+1<<endl;
}

int main()
{
    long long int *A, *B, dni, n, m, d, mi, t, k;
    char z;
    cin>>n>>m;
    A=new long long int[n+1];
    B=new long long int[m+1];
    A[0]=0;
    B[0]=0;
    for (long long int i=0; i<n; i++)
    {
        cin>>d;
        A[i+1]=A[i]+d;
    }
    for (int i=0; i<m; i++)
    {
        cin>>d;
        B[i+1]=B[i]+d;
    }
    cin>>t;
    for (long long int i=0; i<t; i++)
    {
        cin>>d>>mi>>z;
        if (mi==1) dni=d;
        else dni=(z=='A'?A[mi-1]+d:B[mi-1]+d);
        k=(z=='A'?m:n);
        if (z=='A') zamiana(dni, B, k);
        else zamiana(dni, A, k);
    }
    delete [] A;
    delete [] B;
}