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>
const long long MAXN = 1e6 + 10;
long long a[MAXN];
long long b[MAXN];
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
      long long temp;
      cin >> temp;
      a[temp]++;
    }
    for (int i = 0; i < m; i++) {
      long long temp;
      cin >> temp;
      b[temp]++;
    }
    long long ans_num, ans;
    int flag = 1;
    for (int i = 1; i < 1009; i++) {
      if (a[i] == b[i] && a[i] != 0 && b[i] != 0) {
        ans_num = a[i];
        ans = i;
        flag = 0;
        break;
      }
    }
    if (flag) {
      cout << "NO\n";
    } else {
      cout << "YES\n";
      printf("%lld ", ans_num);
      for (int i = 0; i < ans_num; i++) {
        printf("%lld", ans);
      }
      cout << endl;
    }
  }
  return 0;
}
