#include <stdio.h>
#include <map>
#include <vector>
#include <queue>
#include <cstring>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <set>
#include <ctime>
#include <bitset>

using namespace std;

#define ll __int64
#define ull unsigned long long
#define maxn 5010
#define maxm 21000
#define INF 99999999
#define f_min(a,b) (a<b?a:b)

int a,b,c;
int aa[100],bb[100],cc[100];
char s[10];

int main(){
    int t,n;
    scanf("%d",&t);
    while (t--){
        scanf("%d%d%d",&a,&b,&c);
        memset(aa,0,sizeof(aa));
        memset(bb,0,sizeof(bb));
        memset(cc,0,sizeof(cc));//getchar();
        for (int i=1;i<=a;i++){
            scanf("%s %d",s,&n);//printf("s[0]=%c\n",s[0]);
            aa[s[0]-'A']+=n;
        }
        for (int i=1;i<=b;i++){
            scanf("%s %d",s,&n);
            bb[s[0]-'A']+=n;
        }
        for (int i=1;i<=c;i++){
            scanf("%s %d",s,&n);
            cc[s[0]-'A']+=n;
        }
        bool flag=0;
        for (int i=1;i<=100 && !flag;i++){
            for (int j=1;j<=100 && !flag;j++){
                for (int k=0;k<26;k++){

                    if (cc[k]!=(aa[k]*i+bb[k]*j))
                        break;
                    if (k==25) {
                        printf("%d %d\n",i,j);
                        flag=1;
                    }
                }
            }
        }
        if (!flag) puts("NO");
    }
    return 0;
}