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() {
  long long int a, b, c, d, i, j, k, n, t, m, f;
  cin >> t;
  while (t--) {
    cin >> n >> m;
    long long int A[n + 5], B[m + 6], C[100];
    for (i = 0; i < n; i++) cin >> A[i];
    for (i = 0; i < m; i++) cin >> B[i];
    c = 0, k = 0, f = 0;
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        if (A[i] == B[j]) {
          c++;
          C[k++] = A[i];
          break;
        }
      }
    }
    if (c == 0) {
      cout << "No" << endl;
      continue;
    }
    if (c < 3) {
      cout << "Yes" << endl << c << " ";
      for (i = 0; i < k; i++) {
        cout << C[i] << " ";
      }
    } else {
      cout << "Yes" << endl
           << "2"
           << " ";
      for (i = 0; i < 2; i++) {
        cout << C[i] << " ";
      }
    }
    cout << endl;
  }
  return 0;
}
