#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<conio.h>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<list>
#include<string>
#define mem(a)memset(a,0,sizeof(a))
#define rep(i,a,n) for(i=a;i<n;i++)
#define Rep(i,n,a) for(i=n;i>a;i--)
#define LL long long
#define max(a,b)a>b?a:b
#define min(a,b)a<b?a:b
const int maxn=11111;
const int N=111;
const int M=1<<N;
const int mod=100000000;
const int inf=9999999;
using namespace std;
int via[26];
int vib[26];
int vic[26];
char w[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char x;
int main(){
    int A,B,C,T,flag;
    int c;
    int i,j,k;
    cin>>T;
    while(T--){
        cin>>A>>B>>C;
        mem(via);
        rep(i,0,A){
            cin>>x>>c;
            via[x-'A']=c;
        }mem(vib);
        rep(i,0,B){
            cin>>x>>c;
            vib[x-'A']=c;
        }
        mem(vic);
        rep(i,0,C){
            cin>>x>>c;
            vic[x-'A']=c;
        }flag=0;
        rep(i,1,101){
            rep(j,1,101){
                rep(k,0,26){
                    if(i*via[w[k]-'A']+j*vib[w[k]-'A']!=vic[w[k]-'A']){
                        break;
                    }
                }
                if(k==26)break;
            }
            if(k==26)break;
        }
        if(k==26)printf("%d %d\n",i,j);
        else puts("NO");
    }return 0;
}