Pair Sum Check

In this problem, you are given a list of integers and a target integer $T$. Your task is to determine whether there exists a pair of distinct elements in the list such that their sum equals $T$, i.e., whether there exist indices $i$ and $j$ with $i \neq j$ such that $$a_i + a_j = T.$$

Input consists of an integer $N$ (the number of integers) and an integer $T$ on the first line, followed by $N$ integers on the second line. Output "YES" if such a pair exists, otherwise output "NO".

inputFormat

The first line of input contains two space-separated integers: $N$ (the number of elements) and $T$ (the target sum). The second line contains $N$ space-separated integers representing the list.

outputFormat

Output a single line containing “YES” if there exists a pair of integers in the list whose sum is equal to $T$, otherwise output “NO”.## sample

5 9
2 7 11 15 3

YES