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[1005], b[1005], book[1005];
int main() {
  cin >> T;
  while (T--) {
    memset(book, 0, sizeof(book));
    cin >> n >> m;
    for (register int i = 1; i <= n; i++) cin >> a[i], book[a[i]] = 1;
    ;
    for (register int i = 1; i <= m; i++) cin >> b[i];
    int flag = 0;
    for (register int i = 1; i <= m; i++) {
      if (book[b[i]]) {
        flag = 1;
        puts("YES");
        printf("1 %d\n", b[i]);
        break;
      }
    }
    if (!flag) puts("NO");
  }
  return 0;
}
