32 10 s 128 MB

Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall.

Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.

Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.

For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.

## Sample Input | ## Sample Output |
---|---|

5 5 2 2 5 3 2 3 4 2 1 5 3 1 2 5 1 2 | 4 |

while(scanf("%d %d",&N,&M)==2) 혹은 while(scanf("%d %d",&N,&M)!=EOF) 와 같은 형식으로 입력을 받는다.