#include<iostream>
#include<vector>
#include<cstring>
using namespace std;

#define MAX_V 200

int V;
vector<int> G[MAX_V];
int match[MAX_V];
bool used[MAX_V];

void add_edge(int u, int v){
    G[u].push_back(v);
    G[v].push_back(u);
}

bool dfs(int v){
    used[v] = true;
    for(int i = 0; i < G[v].size(); i++){
        int u = G[v][i], w = match[u];
        if(w < 0 || !used[w] && dfs(w)){
            match[v] = u;
            match[u] = v;
            return true;
        }
    }
    return false;
}

int bipartite_matching(){
    int res = 0;
    memset(match, -1, sizeof(match));
    for(int v = 0; v < V; v++){
        if(match[v] < 0){
            memset(used, 0, sizeof(used));
            if(dfs(v))  res++;
        }
    }
    return res;
}

int main(){
    int x, y, e;
    cin >> x >> y >> e;
    V = x+y;
    int a, b;
    while(e-- > 0){
        cin >> a >> b;
        add_edge(a,x+b);
    }
    cout << bipartite_matching() << endl;
    return 0;
}
