SWEA 9229. 한빈이와 Spot Mart

import java.util.Scanner;

public class Solution_9229한빈이와SpotMart2 {
	static Scanner sc = new Scanner(System.in);

	public static int solution() {

		int N = sc.nextInt();
		int M = sc.nextInt();

		int max = -1;
		int[] arr = new int[1000];

		for (int t = 0; t < N; t++) {

			arr[t] = sc.nextInt();
		}
		for (int i = 0; i < N; i++) {
			for (int j = i + 1; j < N; j++) {

				int sum = arr[i] + arr[j];
				if (sum <= M && sum > max)
					max = sum;
			}
		}
		return max;

	}

	public static void main(String[] args) {
		int T = sc.nextInt();

		for (int cnt = 1; cnt <= T; cnt++) {
			System.out.printf("#%d %d", cnt, solution());
			System.out.println();
		}
	}

}