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 solve() {
  long long n, m;
  cin >> n >> m;
  vector<long long> num(1001, 0);
  for (long long i = (0); i < (n); ++i) {
    long long a;
    cin >> a;
    num[a] = 1;
  }
  for (long long i = (0); i < (m); ++i) {
    long long b;
    cin >> b;
    if (num[b] == 1) num[b] = 2;
  }
  for (long long i = (1); i < (1001); ++i) {
    if (num[i] == 2) {
      cout << "YES\n1 " << i << "\n";
      return;
    }
  }
  cout << "NO"
       << "\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
