Ones and zeroes

You are given an array strs of binary strings and two budgets m and n. Choose the largest possible subset of strs such that the total number of '0' characters across the chosen strings is at most m and the total number of '1' characters is at most n. Return the size of that largest subset. There are at most 600 strings, each of length at most 100, and m, n are at most 100.