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 t, n, m, a[1010], b[1010], c[1010], f;
int main() {
  cin >> t;
  while (t--) {
    cin >> n >> m;
    memset(c, 0, sizeof(c));
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      c[a[i]] = 1;
    }
    f = 0;
    for (int i = 1; i <= m; i++) {
      cin >> b[i];
      if (c[b[i]]) {
        cout << "YES" << endl << 1 << ' ' << b[i] << endl;
        f = 1;
        break;
      }
    }
    if (f == 0) cout << "NO" << endl;
  }
}
