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;
void multiply(int arr[2][2], int n) {}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  static const auto _ = []() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    return 0;
  }();
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long m;
    cin >> m;
    ;
    int a[n], b[m];
    vector<int> c(n + m);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a, a + n);
    for (int i = 0; i < m; i++) {
      cin >> b[i];
    }
    sort(b, b + m);
    vector<int>::iterator it, st;
    it = set_intersection(a, a + n, b, b + m, c.begin());
    if (c[0] == 0) {
      cout << "NO";
      return 0;
    } else {
      cout << "YES" << endl;
      cout << c[0] << " ";
    }
    cout << endl;
    c.clear();
  }
}
