#include<bits/stdc++.h>
using namespace std;
int main ()
{
int n;
cin >> n;
while(n--)
{
int s,k;
cin >> s >> k;
vector<int>v;
for(int i = 0 ; i < s;i++)
{
int x;
cin >>x;
v.push_back(x);
}
if(find(v.begin(),v.end(),k) != v.end())
{
cout << "YES" <<endl;
}else cout << "NO" <<endl;
}
}
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |