#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define INF 999999999
using namespace std;
typedef  long long ll;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
// bu qiu chaoyue danqiu tiaozhanziji
int A[30];
int B[30];
int C[30];
int l ,r;
bool tt(int x){
    for(int i=0;i<26;i++){
        if(A[i] * x > C[i]) return true;
    }
    return false;
}
bool test(int x){
    int ff = 0;
        for(int j=1;j<1000;j++){
            int i = 0;
            for(i=0;i<26;i++){
                if(A[i] * x + B[i] *j != C[i])
                    break;
            }
            if(i == 26){
                r = j;return true;
            }
            for(int i=0;i<26;i++)
                if(B[i] * j > C[i]) break;
        }
    return false;
}

int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int a,b,c;
        memset(A,0,sizeof(A));
        memset(B,0,sizeof(B));
        memset(C,0,sizeof(C));
        scanf("%d%d%d",&a,&b,&c);
        char ch;
        int nu;
        for(int i=0;i<a;i++){
            scanf(" %c%d",&ch,&nu);
            A[ch-'A']+=nu;
        }
        for(int i=0;i<b;i++){

            scanf(" %c%d",&ch,&nu);
            B[ch-'A']+=nu;
        }
        for(int i=0;i<c;i++){
            scanf(" %c%d",&ch,&nu);
            C[ch-'A']+=nu;
        }
        bool ac = false;

        for(int i=1;i<1000;i++){
            if(tt(i)) break;
            if(test(i)){
                ac = 1;l = i;break;
            }
        }
        if(ac){
            printf("%d %d\n",l,r);
        }
        else
            printf("NO\n");

    }
    return 0;
}