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;
void solve() {
  int n, m, i, j, ans;
  cin >> n >> m;
  int arr[n], brr[m];
  for (i = 0; i < n; i++) cin >> arr[i];
  for (j = 0; j < m; j++) cin >> brr[j];
  ans = 0;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      if (arr[i] == brr[j]) {
        ans = arr[i];
      }
      break;
    }
  }
  if (ans > 0) {
    cout << "YES" << endl;
    cout << "1"
         << " " << ans << endl;
  } else
    cout << "NO" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
