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, a, b;
int m[1001], n[1001], flag;
int main() {
  cin >> t;
  for (int i = 0; i < t; i++) {
    flag = 0;
    cin >> a >> b;
    for (int x = 0; x < a; x++) cin >> m[x];
    for (int y = 0; y < b; y++) cin >> n[y];
    for (int z = 0; z < a; z++) {
      if (flag == 1) break;
      for (int r = 0; r < b; r++) {
        if (flag == 1) break;
        if (m[z] == n[r]) {
          cout << "YES" << endl << 1 << " " << m[z] << endl;
          flag = 1;
        }
      }
    }
    if (flag == 0) cout << "NO" << endl;
  }
}
