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 t, n, m;
  cin >> t;
  for (int z = 1; z <= t; z++) {
    cin >> n;
    cin >> m;
    int arr[n];
    int brr[m];
    int flag = 0;
    int pos = -1;
    set<int> s;
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      s.insert(arr[i]);
    }
    for (int i = 0; i < m; i++) {
      cin >> brr[i];
      if (s.find(brr[i]) != s.end()) {
        flag = 1;
        pos = i;
      }
    }
    if (pos == -1)
      cout << "NO" << endl;
    else {
      cout << "YES" << endl;
      cout << 1 << " ";
      cout << brr[pos] << endl;
    }
  }
  return 0;
}
