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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, m;
    cin >> n >> m;
    map<long long int, long long int> ma;
    map<long long int, long long int> mb;
    for (long long int i{0}; i < n; i++) {
      long long int a;
      cin >> a;
      ma[a]++;
    }
    for (long long int i{0}; i < m; i++) {
      long long int a;
      cin >> a;
      mb[a]++;
    }
    bool found = false;
    for (auto i : ma) {
      if (mb.count(i.first)) {
        cout << "YES" << endl;
        cout << i.first << endl;
        found = true;
        break;
      }
    }
    if (found == false) {
      cout << "NO" << endl;
    }
  }
  return 0;
}
