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 <iostream>
#include <algorithm>
#include <map>
using namespace std;
int main() {
	int t;
	cin >> t;
	while(t --) {
		map<int, int> mp;
		int n, m;
		cin >> n >> m;
		int a[n + 10] = {0};
		int b[m + 10] = {0};
		for(int i = 0; i < n; i ++) cin >> a[i], mp[a[i]] ++;
		for(int i = 0; i < m; i ++) cin >> b[i];
		int flag = 0;
		int ans = 0;
		for(int i = 0; i < m; i ++) {
			mp[b[i]] ++;
			if(mp[b[i]] > 1) {
				flag = 1;
				ans = b[i];
			}
		}
		if(flag == 0) cout << "NO" << endl;
		else {
			cout << "YES" << endl;
			cout << 1 << ' ' << ans << endl;
		}
	}
	return 0;
} 