#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int n,m,t,e[401][401]={0},match[401]={0},book[401]={0},sum=0;
int dfs(int u){
for(int i=1;i<=m;i++){
if(book[i]==0 && e[u][i]==1){
book[i]=1;
if(match[i]==0 || dfs(match[i])){
match[i]=u;
return 1;
}
}
}
return 0;
}
int main(){
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
e[i][j]=1;
}
}
for(int i=1;i<=t;++i){
int x,y;
scanf("%d%d",&x,&y);
e[x][y]=0;
}
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j) book[j]=0;
if(dfs(i)==1)
sum++;
}
printf("%d",sum);
return 0;
} |