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 argc, char const *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int m;
    cin >> m;
    vector<int> arr1, arr2, result;
    arr1.reserve(n);
    arr2.reserve(m);
    int c;
    for (int i = 0; i < n; i++) {
      cin >> c;
      arr1.push_back(c);
    }
    for (int i = 0; i < m; i++) {
      cin >> c;
      arr2.push_back(c);
    }
    set_intersection(arr1.begin(), arr1.end(), arr2.begin(), arr2.end(),
                     inserter(result, result.end()));
    if (result.empty())
      cout << "NO\n";
    else {
      cout << "YES\n";
      cout << 1 << result[0] << "\n";
    }
  }
  return 0;
}
