Fletcher runs the chandlery at the honeycomb cliffs of Beeswick. Today the books show a list of ledgers, and the numbers must be worked out before sundown. 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 <= 11209; 0 <= a[i],k <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 11209; 0 <= a[i],k <= 1000.
