#P330. 【例56.1】 和为给定数

【例56.1】 和为给定数

Description

Given several integers, determine if there exists a pair of numbers whose sum equals a given value.

Input Format

Three lines:
The first line contains an integer nn (0<n100,0000 < n ≤ 100,000), representing the number of integers.
The second line contains nn integers. The integers range from 00 to 2×1082×10^8.
The third line contains an integer mm (0m2300≤m≤2^{30}), representing the target sum.

Output Format

If there exists a pair of numbers whose sum equals mm, output two integers, with the smaller one first, followed by the larger one, separated by a single space. If multiple pairs satisfy the condition, choose the pair with the smallest first number. If no such pair exists, output "No".

Sample

4
2 5 1 4
6
1 5