1 /*
2 还有17个
3
4 求最小的顶点覆盖 ，也就是最大匹配，hungarian算法上
5
6 建图的时候，如果有一边是0，说明是开始状态，无须在算
7 */
8
9 // include file
10 #include <cstdio>
11 #include <cstdlib>
12 #include <cstring>
13 #include <cmath>
14 #include <cctype>
15 #include <ctime>
16
17 #include <iostream>
18 #include <sstream>
19 #include <fstream>
20 #include <iomanip>
21 #include <bitset>
22 #include <strstream>
23
24 #include <algorithm>
25 #include <string>
26 #include <vector>
27 #include <queue>
28 #include <set>
29 #include <list>
30 #include <functional>
31
32 using namespace std;
33
34 // typedef
35 typedef long long LL;
36 typedef unsigned long long ULL;
37
38 //
39 #define read freopen("in.txt","r",stdin)
40 #define write freopen("out.txt","w",stdout)
41 #define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
42 #define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
43 #define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
44 #define FORp(a,b,c) for(int p=(a);p<(b);p+=c)
45
46 #define FF(i,a) for(int i=0;i<(a);i+++)
47 #define FFD(i,a) for(int i=(a)-1;i>=0;i--)
48 #define Z(a) (a<<1)
49 #define Y(a) (a>>1)
50
51 const double eps = 1e-6;
52 const double INFf = 1e10;
53 const int INFi = 1000000000;
54 const double Pi = acos(-1.0);
55
56 template<class T> inline T sqr(T a){return a*a;}
57 template<class T> inline T TMAX(T x,T y)
58 {
59 if(x>y) return x;
60 return y;
61 }
62 template<class T> inline T TMIN(T x,T y)
63 {
64 if(x<y) return x;
65 return y;
66 }
67 template<class T> inline void SWAP(T &x,T &y)
68 {
69 T t = x;
70 x = y;
71 y = t;
72 }
73 template<class T> inline T MMAX(T x,T y,T z)
74 {
75 return TMAX(TMAX(x,y),z);
76 }
77
78
79 // code begin
80 #define MAXN 110
81 vector<int> G[MAXN];
82 int mt[MAXN];
83 bool used[MAXN];
84 int N,M,K,ans;
85
86 bool hungarian_MM(int i)
87 {
88 FORj(0,G[i].size(),1)
89 {
90 if(!used[ G[i][j] ])
91 {
92 used[G[i][j]] = 1;
93 if( mt[ G[i][j]]==-1 || hungarian_MM(mt[G[i][j]]))
94 {
95 mt[ G[i][j] ] = i;
96 return true;
97 }
98 }
99 }
100 return false;
101 }
102
103 int main()
104 {
105 read;
106 write;
107 int c,a,b;
108 while(scanf("%d",&N)!=-1)
109 {
110 if(N==0) break;
111 scanf("%d %d",&M,&K);
112 FORi(0,N,1)
113 {
114 G[i].clear();
115 }
116 while(K--)
117 {
118 scanf("%d %d %d",&c,&a,&b);
119 if(a*b) G[a].push_back(b);
120 }
121 ans = 0;
122 memset(mt,-1,sizeof(int)*MAXN);
123 FORi(0,N,1)
124 {
125 memset(used,0,sizeof(bool)*MAXN);
126 if( hungarian_MM(i))
127 ans++;
128 }
129 printf("%d\n",ans);
130 }
131 return 0;
132 }
