#include <bits/stdc++.h>

using namespace std;

const int maxN = 1e5 + ;

vector<int> G[maxN];

int match[maxN];

int vis[maxN];

int n, m, sum;

int dfs(int u) {

    for(int i = ; i < G[u].size(); i++) {

        int v = G[u][i];

        //有路而且没被访问

        if(!vis[v]) {

            vis[v] = ;//标记点i已经访问过

            //如果点i未被配对或者找到了新的配对

            if(match[v] ==  || dfs(match[v])) {

                //更新配对关系

                match[v] = u;

                match[u] = v;

                return ;

            }

        }

    }

    return ;

}

int main() {

//    freopen("1.txt","r", stdin);

    scanf("%d %*d %d", &n, &m);

    for(int i = ; i < m; i++) {

        int u, v;

        scanf("%d %d", &u, &v);

        v += ;

        G[u].push_back(v);

        G[v].push_back(u);

    }

    memset(match,  , sizeof(match));

    for(int i = ; i <= n; i++){

        memset(vis, , sizeof(vis));

        if(dfs(i)) {

            sum++;

        }

    }

    printf("%d\n", sum);

}