Deep in the rook towers of Chessfield, Ivo studies rows of ledgers 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 <= 950; 0 <= a[i],k <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 950; 0 <= a[i],k <= 1000.
