1
2 2
1 1
1 2
 1
1 3
3
1 2 3
 1
1 1
1000
1000
 1
2 2
2 2
2 2
 5
4 5
10 8 6 4
1 2 3 4 5
1 1
3
3
1 1
3
2
5 3
1000 2 2 2 3
3 1 5
5 5
1 2 3 4 5
1 2 3 4 5
 1
4 4
1 1 1 1
1 2 3 4
 1
2 3
1 1
1 2 3

YES
1 1
 YES
1 3
 YES
1 1000
 YES
1 2
 YES
1 4
YES
1 3
NO
YES
1 3
YES
1 1
 YES
1 1
 YES
1 1

#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t, n, res, m, x, flag;
  cin >> t;
  while (t--) {
    vector<long long> v1, v2;
    vector<long long>::iterator it;
    cin >> n >> m;
    flag = 0;
    for (long long i = 0; i < n; i++) {
      cin >> x;
      v1.push_back(x);
    }
    for (long long i = 0; i < m; i++) {
      cin >> x;
      v2.push_back(x);
    }
    for (long long i = 0; i < n; i++) {
      it = find(v2.begin(), v2.end(), v1[i]);
      if (it != v2.end()) {
        res = *it;
        flag = 1;
        break;
      }
    }
    if (flag == 1) {
      cout << "YES\n";
      cout << "1 " << res << "\n";
    } else {
      cout << "NO\n";
    }
  }
}
