public int countSupervisors(int[] students, int Y, int J) {
		int min = Integer.MAX_VALUE;
		for (int i = 0; i < students.length; i++) {
			int[] copy = copyOf(students, students.length);
			// copy[i] = Math.max(copy[i] - Y, 0);
			copy[i] -= Math.min(copy[i], Y);
			int count = 0;
			for (int j = 0; j < students.length; j++) {
				count += (copy[j] % J > 0 ? 1 : 0) + copy[j] / J;
			}
			min = Math.min(min, count);

		}
		return min;

	}