int firstMultiple2(int[] divisors, int start) {
boolean found = false;
while (!found) {
for (int i = 0; i < divisors.length; i++) {
if (start % divisors[i] == 0) return start;
}
start++;
}
return -1;
}