1 задача по python, knapsack problem

03 Knapsack problem (A and B list of numbers, N list of strings, and V number is given , where A values of items, B weights of the items, N names of the items and V volume of Knapsack, find out the M maximum value of N items that will suit to the Knapsack)
A = [150, 35, 200, 160, 60, 45, 60, 40, 30, 10, 70, 30, 15, 10, 40, 70, 75, 80, 20, 12, 50, 10], B = [9, 13, 153, 50, 15, 68, 27, 39, 23, 52, 11, 32, 24, 48, 73, 42, 43, 22, 7, 18, 4, 30], N = [map, compass, water, sandwich, glucose, tin, banana, apple, cheese, beer, suntan cream, camera, T-shirt, trousers, umbrella, waterproof trousers, waterproof overclothes, note-case, sunglasses, towel, socks, book]
V = 400
V = 500
V = 600