Ones and zeroes

Given a list of binary strings and two budgets, at most max_zeros zeros and at most max_ones ones in total, choose as many strings as possible so that the chosen strings together stay within both budgets. Return how many you can choose.