#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <ctime>
using namespace std;

using namespace std;

int main(){
    int T;
    scanf("%d", &T);
    while(T--){
        int a,b,c;
        scanf("%d%d%d", &a,&b,&c);
        vector<int> ea(26, 0);
        vector<int> eb(26, 0);
        vector<int> ec(26, 0);

        for(int i=0; i<a; i++){
            char buff[10];
            int v;
            scanf("%s%d", buff, &v);
            ea[buff[0]-'A'] = v;
        }

        for(int i=0; i<b; i++){
            char buff[10];
            int v;
            scanf("%s%d", buff, &v);
            eb[buff[0]-'A'] = v;
        }

        for(int i=0; i<c; i++){
            char buff[10];
            int v;
            scanf("%s%d", buff, &v);
            ec[buff[0]-'A'] = v;
        }

        bool ok = false;
        for(int x=1; x<=100; x++){
            for(int y=1; y<=100; y++){
                bool ok_ = true;
                for(int k=0; k<26; k++){
                    if(ec[k] != ea[k]*x + eb[k]*y){
                        ok_ = false;
                        break;
                    }
                }

                if(ok_){
                    printf("%d %d\n", x, y);
                    ok = true;
                    x = 100;
                    y = 100;
                }
            }
        }

        if(ok == false){
            puts("NO");
        }
    }
    return 0;
}