#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

const int maxn = ;

int n,m,k,vis[maxn],a[maxn][maxn],p[maxn];

int dfs(int x)

{

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

    {

        if(!vis[i]&&a[x][i])

        {

            vis[i]=;

            if(p[i]==-||dfs(p[i]))

            {

                p[i]=x;

                return ;

            }

        }

    }

    return ;

}

int hungary()

{

    int ans=;

    memset(p,-,sizeof(p));

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

    {

        memset(vis,,sizeof(vis));

        if(dfs(i)) ans++;

    }

    return ans;

}

int main(void)

{

    int i,j,id,x,y;

    while(~scanf("%d",&n)&&n)

    {

        memset(a,,sizeof(a));

        scanf("%d%d",&m,&k);

        for(i=;i<=k;i++)

        {

            scanf("%d%d%d",&id,&x,&y);

            if(x&&y) a[x][y]=;

        }

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

    }

    return ;

}