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;
  scanf("%d", &t);
  while (t--) {
    int n, m;
    scanf("%d %d", &n, &m);
    int arr[n];
    int arr1[m];
    unordered_set<int> us;
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      us.insert(arr[i]);
    }
    int flag = 0;
    for (int i = 0; i < m; i++) {
      cin >> arr1[i];
      if (us.find(arr1[i]) != us.end()) {
        cout << "YES" << endl << "1 " << arr1[i] << endl;
        flag = 1;
      }
    }
    if (flag == 0) cout << "NO" << endl;
  }
}
