Given an array **A** of **N** positive integers 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

**Explanation:
Testcases 1:** 10 and 6 are numbers making a pair whose sum is equal to 16.

Mr_Bean | 512 |

Dhirendra121 | 353 |

ashu_tech | 181 |

RishabhTanwar1 | 156 |

cds91 | 137 |

Mr_Bean | 651 |

Dhirendra121 | 458 |

kevinyu102589 | 358 |

kinetic | 339 |

舒义然 | 312 |

akhayrutdinov | 4920 |

Ibrahim Nash | 4444 |

Quandray | 4261 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.