#include <bits/stdc++.h>
using namespace std;

struct Edge{
    int to, cap, rev;
};

const int INF = INT_MAX;
vector<Edge> G[202];
const int ns = 200;
const int nt = 201;

bool used[202];

void add_edge(int from, int to, int cap) {
    G[from].push_back((Edge){ to, cap, (int)G[to].size() });
    G[to].push_back((Edge){ from, 0, (int)G[from].size()-1 });
}

int maxflow(int s, int t, int f) {
    used[s] = true;
    int ret;
    if (s == t) {
        ret = f;
    } else {
        ret = 0;
        for (Edge &e: G[s]) {
            if ( ! used[e.to] && e.cap > 0) {
                int maxf = maxflow(e.to, t, min(f, e.cap));
                if (maxf > 0) {
                    e.cap -= maxf;
                    G[e.to][e.rev].cap += maxf;
                    ret = maxf;
                    break;
                }
            }
        }
    }
    return ret;
}

int main() {
    int X, Y, E;
    cin >> X >> Y >> E;
    for (int i=0; i<E; ++i) {
        int x, y;
        cin >> x >> y;
        add_edge(x, y+100, 1);
    }
    for (int i=0; i<X; ++i) add_edge(ns, i, 1);
    for (int i=0; i<Y; ++i) add_edge(i+100, nt, 1);

    int mx = 0;
    while (1) {
        fill(used, used+202, false);
        int f = maxflow(ns, nt, INF);
        if (f == 0) break;
        mx += f;
    }
    cout << mx << endl;

    return 0;
}
