public static void findModNumbers(int[] sourceNumbers, int... args) {
	print("Числа, которые делятся на " + Arrays.toString(args) + ": ");
	HashSet<Integer> uniqueNumbers = new HashSet<Integer>();
	if (args.length == 1) {
	    for (int sourceNumber : sourceNumbers) {
		if (sourceNumber % args[0] == 0) {
		    print(sourceNumber + ", ");
		}
	    }
	} else if (args.length == 2) {
	    for (int sourceNumber : sourceNumbers) {
		if ((sourceNumber % args[0] == 0 && sourceNumber % args[1] == 0)) {
		    print(sourceNumber + ", ");
		}
	    }
	} else if (args.length >= 3) {
	    for (int sourceNumber : sourceNumbers) {
		for (int i = 0; i < args.length - 1; i++)
		    for (int i2 = 2; i2 < args.length; i2++)
			if ((sourceNumber % args[i] == 0 && sourceNumber
				% args[i + 1] == 0)
				&& (sourceNumber % args[0] == 0 && sourceNumber
					% args[i2] == 0)) {
			    if (uniqueNumbers.add(sourceNumber)) {
				print(sourceNumber + ", ");
			    }
			}
	    }
	}
	println();
    }