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;
long long l, r, a, x, y, z, b, i, j, k, n, m, num, ans, t;
long long arr[200005], arr2[200005];
string s;
char str[10][10];
bool cmp(long long a, long long b) { return a > b; }
int main() {
  cin >> t;
  for (k = 0; k < t; k++) {
    memset(arr, 0, sizeof(arr));
    cin >> n >> m;
    for (i = 0; i < n; i++) {
      cin >> a;
      arr[a] = 1;
    }
    b = -1;
    for (i = 0; i < m; i++) {
      cin >> a;
      if (arr[a] == 1) {
        b = a;
      }
    }
    if (b == -1)
      cout << "NO\n";
    else {
      cout << "YES" << '\n' << "1 " << b << '\n';
    }
  }
  return 0;
}
