It is audit day at the orchid house of Bloomglass. Gail spreads the shelves records across the table and picks up a sharp pencil. 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 <= 661; 0 <= a[i],k <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 661; 0 <= a[i],k <= 1000000.
