Woburn Team Practice '07

A cow has just issued you a challenge! You are given a list of ~N~ ~(1 \le N \le 100)~ possibly empty bitstrings (strings consisting of only 0s and 1s), whose lengths do not exceed ~50~. You are also given ~n_0~ zeroes ~(0 \le n_0 \le 300)~ and ~n_1~ ones ~(0 \le n_1 \le 300)~ at your disposal. The cow wants to know the maximum number of bitstrings in the list that you can create using those ~0~s and ~1~s. Of course, once you use a ~0~ or ~1~, you cannot use it again.

Input Specification

The first line of the input file contains a single integer ~T~ ~(1 \le T \le 10)~, indicating the number of test cases to follow.

Each test case begins with a single line listing the integers ~N~, ~n_0~, and ~n_1~ as described above. The next ~N~ lines list the bitstrings in your list. The bitstrings don't appear in any particular order, and may contain duplicates.

Output Specification

Output the following (on separate lines) for each test case:

A single integer that is the maximum number of bitstrings you can create.

Sample Input

2
3 3 1
00
1
100
3 2 4
00
101
110

Sample Output

2
2

Explanation

Case ~1~: You can create the first two bitstrings in the list.
Case ~2~: Make the last two bitstrings this time!