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 seach(int c, int arr[], int size) {
  for (int i = 0; i < size; i++) {
    if (arr[i] == c) {
      return 1;
    }
  }
  return 0;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int k1;
    cin >> k1;
    int k2;
    cin >> k2;
    int arr1[k1];
    for (int j = 0; j < k1; j++) {
      int c;
      cin >> c;
      arr1[j] = c;
    }
    bool p = false;
    for (int j = 0; j < k2; j++) {
      int c;
      cin >> c;
      if (seach(c, arr1, k1) == 1) {
        if (!p) cout << "Yes\n1 " << c << endl;
        p = true;
      }
    }
    if (!p) cout << "No\n";
  }
}
