Deep in the quays of Driftwood, Brevin studies rows of shelves entries. One clean number will settle the guild's oldest argument. 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 <= 725; 0 <= a[i],k <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 725; 0 <= a[i],k <= 1000000000.
