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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

struct Graph{
  int n, m;
  vector<vector<int>> edges;
  vector<bool> used;
  vector<bool> vis;
  vector<int> dis;
  vector<int> match;
  Graph(){}
  Graph(int n, int m): n(n), m(m){
    edges.resize(n);
    used.resize(n, false);
    vis.resize(n, false);
    dis.resize(n, -1);
    match.resize(m, -1);
  }
  void adde(int u, int v){
    edges[u].push_back(v);
  }
  void bfs(){
    dis.assign(n, -1);
    queue<int> q;
    for(int i = 0; i < n; i++){
      if(!used[i]){
        dis[i] = 0;
        q.push(i);
      }
    }

    while(!q.empty()){
      int p = q.front(); q.pop();
      for(auto &e: edges[p]){
        int c = match[e];
        if(c >= 0 && dis[c] == -1){
          dis[c] = dis[p] + 1;
          q.push(c);
        }
      }
    }
  }
  bool dfs(int i){
    vis[i] = true;
    for(auto &e: edges[i]){
      int c = match[e];
      if(c < 0 || (!vis[c] && dis[c] == dis[i] + 1 && dfs(c))){
        match[e] = i;
        used[i] = true;
        return true;
      }
    }
    return false;
  }
  int maximum_matching(){
    int res = 0;
    while(true){
      bfs();
      vis.assign(n, false);
      int f = 0;
      for(int i = 0; i < n; i++){
        if(!used[i] && dfs(i)){
          ++f;
        }
      }
      if(f == 0)return res;
      res += f;
    }
  }
};


int main(int argc, char const* argv[])
{
  int n, m, e;
  cin >> n >> m >> e;
  Graph g(n, m);
  rep(i, e){
    int u, v;
    cin >> u >> v;
    g.adde(u, v);
  }
  cout << g.maximum_matching() << endl;
  return 0;
}



Measured memory_bytes: 3276