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;
long long t;
long long n, m;
void Solves() {
  cin >> t;
  while (t--) {
    cin >> n >> m;
    long long a[n + 5], b[m + 5], ans = 0;
    map<long long, long long> Count;
    long long result;
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      Count[a[i]]++;
    }
    for (long long i = 0; i < m; i++) {
      cin >> b[i];
      if (Count[b[i]] > 0) {
        ans++;
        result = b[i];
      }
    }
    if (ans != 0) {
      cout << "YES" << endl;
      cout << ans << " " << result << endl;
    } else
      cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  Solves();
  return 0;
}
