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;
void g_o_a_l() {
  long long n, m, q;
  string s;
  map<long long, long long> p;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> q;
    ++p[q];
  }
  long long j = 0;
  for (int i = 0; i < m; i++) {
    cin >> q;
    ++p[q];
    if (p[q] > 1) j = q;
  }
  if (j)
    cout << "YES"
         << "\n"
         << 1 << " " << j << "\n";
  else
    cout << "NO"
         << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    g_o_a_l();
  }
  return 0;
}
