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 m[1005];
void solve() {
  int n, m1;
  cin >> n >> m1;
  for (int i = 1; i <= 1003; i++) m[i] = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    m[x]++;
  }
  int y = 0;
  for (int i = 1; i <= m1; i++) {
    int x;
    cin >> x;
    if (m[x] > 0) {
      y = x;
    }
  }
  if (y == 0)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    cout << 1 << ' ' << y << endl;
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
}
