Given a set of strings whose size is S, each string only contains char 'A' or 'B' (no lower case). Given two positive integer M and N, please

find the maximum subset of strings such that the total number of char 'A' in the subset is less than or equals to M and the total number of char 'B' is less than or equals to N.

For this problem, just output the size of the subset. ( for this problem, S <= 25 )

The first line contains integer M N and S
the following S lines, each one contains one string with 'A' and 'B'

One integer which is the size of the biggest subset.

In the example, we can make the subset of {A, B, AB, BA}, the total number of A is 3 and the total number of B is 3. therefore, the output is 4 which is the size of the set.