Cacher is the code snippet organizer for pro developers

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int count = sc.nextInt();
		while (count-- != 0) {
			int n = sc.nextInt(), a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt(), i = 0, temp = 0, j = 0;
			for (i = 2; i <= a * b * c; i++) {
				if (i % a == 0 && i % b == 0 && i % c == 0)
					break;
			}
			for (j = 1; j <= n; j++) {
				int num = i * j, tot = 0;
				tot = (num / a) * (num / b) * (num / c);
				if (tot > n)
					break;
				temp = tot;
			}
			if (temp == 0)
				System.out.println("No solution");
			else
				System.out.println(temp);
		}
	}
   /* 題目：[C_GM16-易] 堆積木
    作者：1010
    時間：西元 2016 年 8 月 */
}