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 main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int m;
    cin >> m;
    unordered_map<int, int> ma;
    for (int x = 0; x < n; x++) {
      int temp;
      cin >> temp;
      ma[temp]++;
    }
    int flag = 0;
    for (int x = 0; x < m; x++) {
      int temp;
      cin >> temp;
      if (ma[temp] > 0 && flag == 0) {
        cout << "YES\n1 " << temp;
        flag = 1;
      }
    }
    if (flag == 0) {
      cout << "NO\n";
    }
  }
}
