#include <cstdio>#include <cstring>#include <algorithm>#include <climits>#include <string>#include <iostream>#include <map>#include <cstdlib>#include <list>#include <set>#include <queue>#include <stack>#include<math.h>using namespace std;int n,m;const int maxn=105;int g[maxn][maxn];int link[maxn*maxn];int used[maxn];int dfs(int x){    for(int i=1;i<=m;i++){        if(!used[i]&&g[x][i]){            used[i]=1;            if(link[i]==-1||dfs(link[i])){                link[i]=x;                return 1;            }        }    }    return 0;}void solve(){    int ans=0;    memset(link,-1,sizeof(link));    for(int i=1;i<=n;i++){        memset(used,0,sizeof(used));        if(dfs(i)) ans++;    }    printf("%d\n",ans);}int main(){    int k;    while(cin>>n,n){        cin>>m>>k;        memset(g,0,sizeof(g));        for(int i=0;i<k;i++){            int a;int b;int c;            cin>>a>>b>>c;            g[b][c]=1;        }        solve();    }    return 0;}