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 i, a[n], b[m], j, flag = 0, ans = 0;
    for (i = 0; i < n; i++) {
      cin >> a[i];
    }
    for (i = 0; i < m; i++) {
      cin >> b[i];
    }
    sort(a, a + n);
    sort(b, b + m);
    i = 0;
    j = 0;
    while (i < n && j < m) {
      if (a[i] == b[j]) {
        ans = a[i];
        flag = 1;
        break;
      } else if (a[i] < b[j])
        i++;
      else
        j++;
    }
    while (i < n) {
      if (a[i] == b[j] && flag == 0) {
        ans = a[i];
        flag = 1;
        break;
      }
      i++;
    }
    while (j < m) {
      if (a[i] == b[j] && flag == 0) {
        ans = a[i];
        flag = 1;
        break;
      }
      j++;
    }
    if (!flag)
      cout << "NO"
           << "\n";
    else
      cout << "YES"
           << "\n"
           << "1"
           << " " << ans << "\n";
  }
  return 0;
}
