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

**Input:**

First line of input contains number of testcases T. For each testcase, first line of input contains n and x. Next line contains array elements.

**Output:**

Print 1 if there exist three elements in A whose sum is exactly x, else 0.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 10^{3}

1 ≤ A[i] ≤ 10^{5}

**Example:**

**Input:**

2

6 13

1 4 45 6 10 8

5 10

1 2 4 3 6

**Output:**

1

1

**Explanation:
Testcase 1:** There is one triplet with sum 13 in the array. Triplet elements are 1, 4, 8, whose sum is 13.

Author: kartik

bhatabhi554 | 32 |

dayman | 28 |

SunkyuHwang | 26 |

sidshahz1 | 24 |

bently_nixon | 24 |

blackshadows | 918 |

SunkyuHwang | 794 |

bently_nixon | 679 |

Shaurya Khanna | 490 |

JojiJoseph | 470 |

akhayrutdinov | 5043 |

Ibrahim Nash | 4959 |

blackshadows | 4618 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.