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() {
  int n, m;
  int t;
  cin >> t;
  while (t--) {
    bool h = 0;
    cin >> n >> m;
    int an[n], am[m];
    for (int i = 0; i < n; i++) cin >> an[i];
    for (int i = 0; i < m; i++) cin >> am[i];
    sort(an, an + n);
    sort(am, am + m);
    int i = 0, j = 0, k = 0;
    while (i < n && j < m) {
      if (an[i] == am[j]) {
        k = an[i];
        h = 1;
        break;
      }
      if (an[i] > am[j]) j++;
      if (an[i] < am[j]) i++;
    }
    if (h)
      cout << "YES" << endl << 1 << ' ' << k << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
