Бинарный поиск

template<class ForwardIt, class T>
bool bin_s(ForwardIt first, ForwardIt last, const T & value)
{
    first = ::lower_bound(first, last, value);
    return (!(first == last) && !(value < *first));
}

*first

 binary_search(b, b + m, f[i])

#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <deque>
#include <utility>
#include <string>
#include <set>
#include <iterator>
#include <queue>
#include <cstring>
#include <stack>
#include <math.h>
#include <algorithm>
#pragma warning(disable : 4996);
#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);
#define ll long long
#define MOD 1000000007
#define rep(i, k, n) for (i = k; i <= n; i++)
#define repp(i, k, n, x) for (i = k; i <= n; i = i + x)
#define irep(i, k, n) for (i = k; i >= n; i--)
#define endl "\n"
#define cendl(k) cout << k << endl;
#define cspace(k) cout << k << " ";
#define No cspace("NO");
#define Yes cspace("YES");
#define newl cout << endl;
#define space cout << " ";
#define sz(x) ((ll)x.size())
#define test      \
    int tests;    \
    cin >> tests; \
    while (tests--)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(x) ((x) < 0 ? -(x) : (x))
#define pmax(a, b) \
    if (a < b)     \
        swap(a, b);
#define pmin(a, b) \
    if (a > b)     \
        swap(a, b);
#define c cout
#define fx cerr << "/////";
//#define bin_s binary_search
/*
template<class ForwardIt, class T>
bool bin_s(ForwardIt first, ForwardIt last, const T & value)
{
    first = std::lower_bound(first, last, value);
    return (!(first == last) && !(value < *first));
}*/
template <class T1, class T2>
ll gcd(T1 a, T2 b)
{
    if (b == 0) return a;
    a %= b;
    return gcd(b, a);
}
using namespace std;
const ll inf = (ll)1e18 + 111;
const int iinf = (int)1e9 + 111;
const int SIZE = 1e6 + 11;
//#define Bug
ll q, n, t, w, m, x, y, i, j, k, ans, sum, mid, mx, mn = 1e18, p, a, b, z, l, r;
ll f[10000], f2[10000];
double dbl;
set<ll> sit;
set<char> chset;
string s1, s, s2, str, s3;
char ch, cc, hc;
char cm[1000][1000];
int main()
{
#ifdef Bug
    freopen("", "r+", stdin);
    freopen("", "w+", stdout);
#endif
    fastio;
    test{
        ans = 0;
        cin >> n >> m;
    rep(i, 0, n - 1) {
        cin >> f[i];
    }
    rep(i, 0, m - 1) {
        cin >> f2[i];
    }
    sort(f2, f2 + m);
    rep(i, 0, n - 1) {
        if (binary_search(b, b + m, f[i])) {
            ans = 1;
            cout << "YES"; newl;
            c << 1 << " " << f[i]; newl;
            break;
        }
    }
    if (ans == 0) {
        c << "NO"; newl;
    }
    }
}