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 read() {
  int ans = 0, sign = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    ans = (ans << 1) + (ans << 3) + (ch ^ 48);
    ch = getchar();
  }
  return ans * sign;
}
long long gcd(long long x, long long y) { return y == 0 ? x : (gcd(y, x % y)); }
int main() {
  int T;
  cin >> T;
  while (T--) {
    int n, m;
    cin >> n >> m;
    int num[1005];
    memset(num, 0, sizeof(num));
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      if (!num[x]) num[x]++;
    }
    for (int i = 0; i < m; i++) {
      int x;
      cin >> x;
      if (num[x]) num[x]++;
    }
    bool flag = 1;
    for (int i = 0; i < 1005; i++) {
      if (num[i] == 2) {
        cout << "YES" << '\n' << 1 << " " << i << '\n';
        flag = 0;
        break;
      }
    }
    if (flag) cout << "NO" << '\n';
  }
  return 0;
}
