**Compilation/Execution Result:**

Given an array A[] of n numbers and another number x, determine whether or not there exist two elements in A whose sum is exactly x.

**Input:**

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N and X,N is the size of array.

The second line of each test case contains N integers representing array elements C[i].

**Output:**

Print "Yes" if there exist two elements in A whose sum is exactly x, else "No" without quotes.

**Constraints:**

1 ≤ T ≤ 200

1 ≤ N ≤ 200

1 ≤ C[i] ≤ 1000

**Example:**

**Input:**

2

6 16

1 4 45 6 10 8

5 10

1 2 4 3 6

**Output:**

Yes

Yes

surbhi_7 | 128 |

Rajat Thakur 2 | 115 |

John Carey | 92 |

shaktiman_shaktiman_shaktiman | 91 |

nancygarg258_pec | 90 |

Ibrahim Nash | 604 |

ashrepos | 490 |

RealHorror | 368 |

shaktiman_shaktiman_shaktiman | 363 |

shi143din | 343 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2435 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |