TreeSet<Integer> set = new TreeSet<>();

    for(int i = 0; i < keyboards.length; i++) {
        for(int j = 0; j < drives.length; j++) {
            set.add(keyboards[i] + drives[j]);
        }
    }

    return set.floor(b) == null ? -1 : set.floor(b);