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 a;
  cin >> a;
  while (a--) {
    int b, c;
    cin >> b >> c;
    int arr1[b], arr2[c];
    set<int> check;
    for (int j = 0; j < b; j++) {
      cin >> arr1[j];
      check.insert(arr1[j]);
    }
    int x = -1;
    for (int j = 0; j < c; j++) {
      cin >> arr2[j];
      if (check.count(arr2[j])) x = arr2[j];
    }
    if (x == -1)
      cout << "NO\n";
    else {
      cout << "YES\n";
      cout << "1"
           << " " << x << "\n";
    }
  }
}
