def getMoneySpent(keyboards, drives, b):
keyboards.sort(reverse = True)
drives.sort(reverse = True)
summ = 0
maxP = -1
for i in range(len(keyboards)):
for j in range(len(drives)):
summ = keyboards[i] + drives[j]
if summ <= b and summ > maxP:
maxp = summ
return maxp
ZGVmIGdldE1vbmV5U3BlbnQoa2V5Ym9hcmRzLCBkcml2ZXMsIGIpOgogICAga2V5Ym9hcmRzLnNvcnQocmV2ZXJzZSA9IFRydWUpCiAgICBkcml2ZXMuc29ydChyZXZlcnNlID0gVHJ1ZSkKICAgIHN1bW0gPSAwCiAgICBtYXhQID0gLTEKICAgIGZvciBpIGluIHJhbmdlKGxlbihrZXlib2FyZHMpKToKICAgICAgICBmb3IgaiBpbiByYW5nZShsZW4oZHJpdmVzKSk6CiAgICAgICAgICAgIHN1bW0gPSBrZXlib2FyZHNbaV0gKyBkcml2ZXNbal0KICAgICAgICAgICAgaWYgc3VtbSA8PSBiIGFuZCBzdW1tID4gbWF4UDoKICAgICAgICAgICAgICAgIG1heHAgPSBzdW1tCiAgICByZXR1cm4gbWF4cCAgICAgICAgICAgICAgICAK