#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <set>
#include <map>
#include <numeric>
#include <bitset>
#include <cmath>
#include <climits>
#include <functional>
#include <complex>
#include <ctime>
#include <fstream>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
typedef long long ll;

void solve() {
    int a, b, c;
    cin >> a >> b >> c;
    vector<int> A(26), B(26), C(26);
    rep(i, a) {
        char ch;
        int num;
        cin >> ch >> num;
        A[ch - 'A'] += num;
    }
    rep(i, b) {
        char ch;
        int num;
        cin >> ch >> num;
        B[ch - 'A'] += num;
    }
    rep(i, c) {
        char ch;
        int num;
        cin >> ch >> num;
        C[ch - 'A'] += num;
    }

    for (int i = 1; i <= 100; i++) {
        for (int j = 1; j <= 100; j++) {
            bool ok = true;
            for (int k = 0; k < 26; k++) {
                ok &= A[k] * i + B[k] * j == C[k];
            }
            if (ok) {
                cout << i << " " << j << endl;
                return;
            }
        }
    }
    cout << "NO" << endl;
}

int main() {
    int T;
    cin >> T;
    rep(i, T) solve();
    return 0;
}