Codeforces Round #658 (Div. 2), problem: (A) Common Subsequence

 https://codeforces.com/contest/1382/problem/A

LANG : MS C++ 2017

# include <iostream>
# include <cstdio>
# include <cstring>
# include <algorithm>
using namespace std;
int main() {
	int T, n, m, i;
	int a[1005], b[1005], flag[1005];
	scanf_s("%d", &T);
	while (T--) {
		scanf_s("%d %d", &n, &m);
		memset(flag, 0, sizeof(flag));
		for (i = 0; i < n; i++) {
			scanf_s("%d", &a[i]);
		}
		for (i = 0; i < m; i++) {
			scanf_s("%d", &b[i]);
			flag[b[i]] = 1;
		}
		for (i = 0; i < n; i++) {
			if (flag[a[i]]) {
				printf("YES\n1 %d\n", a[i]);
				break;
			}
		}
		if (i == n) {
			printf("NO\n");
		}
	}
	return 0;
}