if(mp[x[i]+dx[j]].find(y[i]+dy[j])!=mp[x[i]+dx[j]].end()) add(i,mp[x[i]+dx[j]][y[i]+dy[j]]);

R tmp=mp[x[i]+dx[j]][y[i]+dy[j]];

if(tmp) add(i,tmp);

#include<cstdio>

#include<iostream>

#include<cstring>

#include<vector>

#include<map>

#define R register int

const int dx[]={,,,,,-,-,-},dy[]={,,,-,-,-,,};

using namespace std;

inline int g() {

    R ret=; register char ch; while(!isdigit(ch=getchar())) ;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret;

}

#define pb(x) push_back(x)

int k,n,m,cnt=,ind,cc,top,ans,num;

int lst[],lst2[],x[],y[],op[],d[];

int vr[],nxt[],fir[],dfn[],scc[],stk[],low[],c[];

vector<int>a[],b[];

map<int,int> mp[];

bool vis[];

inline void add(int u,int v) {if(u==v) return ;vr[++cnt]=v,nxt[cnt]=fir[u],fir[u]=cnt;}

inline void init() {

    for(R i=;i<=n;++i) {

        R x=,sz=a[i].size();

        for(R j=;j<sz;++j) if(op[a[i][j]]==) {x=a[i][j]; break;}

        for(R j=;j<sz;++j) {add(x,a[i][j]); if(op[a[i][j]]==) add(a[i][j],x);}

    }

    for(R i=;i<=m;++i) {

        R x=,sz=b[i].size();

        for(R j=;j<sz;++j) if(op[b[i][j]]==) {x=b[i][j]; break;}

        for(R j=;j<sz;++j) {add(x,b[i][j]); if(op[b[i][j]]==) add(b[i][j],x);}

    }

    for(R i=;i<=k;++i) if(op[i]==) for(R j=;j<;++j)

        if(mp[x[i]+dx[j]].find(y[i]+dy[j])!=mp[x[i]+dx[j]].end()) add(i,mp[x[i]+dx[j]][y[i]+dy[j]]);void tarjan(int u) { low[u]=dfn[u]=++num; stk[++top]=u,vis[u]=true;

    for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

        if(!dfn[v]) {

            tarjan(v);

            low[u]=min(low[u],low[v]);

        } else if(vis[v]) low[u]=min(low[u],dfn[v]);

    } if(low[u]==dfn[u]) {

        R tmp; ++cc;

        do tmp=stk[top],--top,vis[tmp]=false,c[tmp]=cc,++scc[cc]; while(tmp!=u);

    }

}

int vv[],nn[],ff[];

inline void addc(int u,int v) {vv[++cnt]=v,nn[cnt]=ff[u],ff[u]=cnt;}

inline void solve() {

    cnt=; for(R u=;u<=k;++u) for(R i=fir[u];i;i=nxt[i])

        if(c[u]!=c[vr[i]]) addc(c[u],c[vr[i]]);

}

inline void dp(int u) { vis[u]=true;

    for(R i=ff[u];i;i=nn[i]) { R v=vv[i];

        if(!vis[v]) dp(v);

        d[u]=max(d[v],d[u]);

    } d[u]+=scc[u]; ans=max(d[u],ans);

}

signed main() {

    k=g(),n=g(),m=g();

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

        x[i]=g(),y[i]=g(),op[i]=g();

        mp[x[i]][y[i]]=i;

        a[x[i]].pb(i),b[y[i]].pb(i);

    } init(); for(R i=;i<=k;++i) if(!dfn[i]) tarjan(i);

    solve(); memset(vis,false,sizeof(vis));

    for(R i=;i<=cc;++i) if(!vis[i]) dp(i);

    printf("%d\n",ans); return ;

}