"""
    An optimized version. Instead of checking all combinations, we sort both lists in descending order
    and break the inner loop when b - total cannot improve."""
		
def getMoneySpent(keyboards, drives, b):
    keyboards.sort(reverse = True)
    drives.sort(reverse = True)
    max_spent = -1
    diff = b 
    for k in keyboards:
        for d in drives:
            total = k + d
            if b - total >= 0:
                if b - total < diff:
                    diff = b - total
                    max_spent = total
                else :
                    break
    return max_spent

from itertools import product
def get_money_spent(keyboards, drives, b):
    possible_sums = [ x + y for x,y in list(product(keyboards, drives)) if x + y <= b ]
    return max(possible_sums) if len(possible_sums) > 0 else -1

def getMoneySpent(b, keyboards, drives):
    # 
    # Write your code here.
    final = []
    for i in keyboards:
        for j in drives:
            if (i+j) <= b:
                final.append(i+j)
                
    if len(final) == 0:
        return -1
    else:
        return max(final)