// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#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(st, itr) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#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 FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
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;}

template <typename T>
struct edge {int to; T cap; int rev;};

template <typename T>
struct Graph_ {
  int n;
  vector<bool> used;
  vector<vector<edge<T>> > vec;
  Graph_(){}
  Graph_(int ns) {
    n = ns;
    used.resize(n);
    vec.resize(n);
  }
  void adde(int at, int to, T cap){
    vec[at].pb((edge<T>){to, cap, (int)vec[to].size()});
    vec[to].pb((edge<T>){at, 0, (int)vec[at].size() - 1});
  }
  T dfs(int s, int t, T f){
    if(s == t)return f;
    used[s] = true;
    for(int i = 0; i < vec[s].size(); i++){
      edge<T> &e = vec[s][i];
      if(!used[e.to] && e.cap > 0){
        int d = dfs(e.to, t, min(f, e.cap));
        if(d > 0){
          e.cap -= d;
          vec[e.to][e.rev].cap += d;
          return d;
        }
      }
    }
    return 0;
  }
  T min_cut(int s, int t){
    return max_flow(s, t);
  }
  T max_flow(int s, int t){
    T inf = numeric_limits<T>::max();
    T flow = 0;

    while(true){
      fill(used.begin(), used.end(), false);
      int f = dfs(s, t, inf);
      if(f == 0)return flow;
      flow += f;
    }
  }
};

typedef Graph_<int> GraphI;
typedef Graph_<ll> GraphL;

struct BGraph{
  int n, m;
  GraphI graph;
  BGraph(int n, int m): n(n), m(m){
    graph = GraphI(n + m + 2);
    for(int i = 0; i < n; i++){
      graph.adde(0, get_left_index(i), 1);
    }
    for(int i = 0; i < m; i++){
      graph.adde(get_right_index(i), n + m + 1, 1);
    }
  }
  int get_left_index(int i){
    return i + 1;
  }
  int get_right_index(int i){
    return i + n + 1;
  }
  void adde(int at, int to){
    graph.adde(get_left_index(at), get_right_index(to), 1);
  }
  int maximum_matching(){
    return graph.max_flow(0, n + m + 1);
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m, e;
  cin >> n >> m >> e;
  BGraph graph(n, m);
  rep(i, e){
    int x, y;
    cin >> x >> y;
    graph.adde(x, y);
  }
  cout << graph.maximum_matching() << endl;
  return 0;
}



Measured memory_bytes: 3384