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;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    int a, b;
    vector<int> s1;
    vector<int> s2;
    for (int i = 0; i < n; i++) {
      cin >> a;
      s1.push_back(a);
    }
    for (int i = 0; i < m; i++) {
      cin >> b;
      s2.push_back(b);
    }
    int size;
    if (m > n)
      size = n;
    else {
      size = m;
    }
    int k = 1, val, flag = 0, H1[1000] = {0};
    int H2[1000] = {0};
    for (int i = 0; i < n; i++) {
      H1[s1[i]]++;
    }
    int j = 0;
    for (int i = 0; i < m; i++) {
      if (H1[s2[i]] > 0) {
        val = s2[i];
        flag = 1;
        j++;
        break;
      }
    }
    if (flag == 1) {
      cout << "YES\n";
      cout << k << " " << val << "\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
