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;
const int N = 1e3 + 9;
unordered_map<int, int> mp1;
int s1[N];
int s2[N];
int main() {
  cin >> T;
  while (T--) {
    mp1.clear();
    int n, m;
    cin >> n >> m;
    memset(s1, 0, sizeof(s1));
    memset(s2, 0, sizeof(s2));
    for (int i = 0; i < n; i++) {
      cin >> s1[i];
      mp1[s1[i]] = 1;
    }
    for (int i = 0; i < m; i++) cin >> s2[i];
    int ans = 0;
    bool flag = false;
    for (int i = 0; i < m; i++) {
      if (mp1[s2[i]] == 1) {
        flag = true;
        ans = s2[i];
        break;
      }
    }
    if (flag)
      printf("1 %d\n", ans);
    else
      printf("0\n");
  }
  return 0;
}
