The council of the basalt cliffs of Obsidian Shore pays by the answer, and Ojas intends to earn it. First: the full register of weights. Task: Print YES if two distinct elements sum to exactly k, otherwise NO. Input format: First line: n and k. Second line: n integers. Output format: Print YES or NO. Constraints: 2 <= n <= 434; -1000000000 <= a[i],k <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 434; -1000000000 <= a[i],k <= 1000.
