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>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
long long int t, n, m, a[1005], b[1005];
map<long long int, long long int> cnt;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> t;
  while (t--) {
    cin >> n >> m;
    cnt.clear();
    for (long long int i = 1; i <= n; i++) {
      cin >> a[i];
      cnt[a[i]]++;
    }
    for (long long int i = 1; i <= m; i++) {
      cin >> b[i];
      cnt[b[i]]++;
    }
    for (long long int i = 1; i <= 1005; i++) {
      if (cnt[i] >= 2) {
        cout << "YES" << '\n';
        cout << i << '\n';
        goto End;
      }
    }
    cout << "NO" << '\n';
  End:
    n = 0;
  }
}
