#include<bits/stdc++.h>
#define int long long
#define N 1001001
using namespace std;
int n,r,c,h[N],w[N],bl[N],cnt[N],dp[N],dfnid,dfn[N],low[N],vis[N],id,in[N],ans;
int dx[]={-1,-1,-1,0,0,1,1,1},dy[]={-1,0,1,-1,1,-1,0,1};
map<pair<int,int>,int>mp;
vector<int>g[N],e[N],hh[N],ww[N];
queue<int>q;
stack<int>st;
struct node
{
    int x,y,t;
    bool operator < (const node &s ) const
    {
        return t<s.t;
    }
}a[N];
void dfs(int u)
{
    dfnid++;
    dfn[u]=dfnid;
    low[u]=dfnid;
    st.push(u);
    vis[u]=1;
    for(int i=0;i<g[u].size();i++)
    {
        int v=g[u][i];
        if(dfn[v]==0)
        {
            dfs(v);
            low[u]=min(low[u],low[v]);
        }
        else if(vis[v]==1)
            low[u]=min(low[u],low[v]);
    }
    if(dfn[u]==low[u])
    {
        id++;
        while(1)
        {
            int v=st.top();
            st.pop();
            cnt[id]++;
            vis[v]=0;
            bl[v]=id;
            if(v==u)
                break;
        }
    }
}
signed main()
{
    cin>>n>>r>>c;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].x>>a[i].y>>a[i].t;
        if(a[i].t==1)
            a[i].t=2;
        else if(a[i].t==2)
            a[i].t=1;
    }

    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
    {
        if(a[i].t!=1)
            hh[a[i].y].push_back(i);
        if(a[i].t!=2)
            ww[a[i].x].push_back(i);
    }
    for(int i=1;i<=n;i++)
    {
        mp[{a[i].x,a[i].y}]=i;
        if(a[i].t==1)
        {
            if(h[a[i].y]==0)
            {
                h[a[i].y]=i;
                for(int j=0;j<hh[a[i].y].size();j++)
                {
                    int v=hh[a[i].y][j];
                    g[i].push_back(v);
                }
            }
            else
            {
                g[i].push_back(h[a[i].y]);
                g[h[a[i].y]].push_back(i);
            }
        }
        else if(a[i].t==2)
        {
            if(w[a[i].x]==0)
            {
                w[a[i].x]=i;
                for(int j=0;j<ww[a[i].x].size();j++)
                {
                    int v=ww[a[i].x][j];
                    g[i].push_back(v);
                }
            }
            else
            {
                g[i].push_back(w[a[i].x]);
                g[w[a[i].x]].push_back(i);
            }
        }
        else
        {
            for(int j=0;j<8;j++)
            {
                int tx=a[i].x+dx[j],ty=a[i].y+dy[j];
                if(mp.find({tx,ty})!=mp.end())
                    g[i].push_back(mp[{tx,ty}]);
            }
        }
    }
    for(int i=1;i<=n;i++)
        if(dfn[i]==0)
            dfs(i);
    for(int i=1;i<=n;i++)
        for(int j=0;j<g[i].size();j++)
        {
            int v=g[i][j];
            if(bl[i]!=bl[v])
            {
                e[bl[i]].push_back(bl[v]);
                in[bl[v]]++;
            }
        }
    for(int i=1;i<=id;i++)
        if(in[i]==0)
        {
            dp[i]=cnt[i];
            ans=max(ans,dp[i]);
            q.push(i);
        }
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int i=0;i<e[u].size();i++)
        {
            int v=e[u][i];
            dp[v]=max(dp[v],dp[u]);
            in[v]--;
            if(in[v]==0)
            {
                dp[v]+=cnt[v];
                ans=max(ans,dp[v]);
                q.push(v);
            }
        }
    }
    cout<<ans;
	return 0;
}
/*
10 7 7
2 2 2
2 4 2
1 7 2
2 7 2
4 2 2
4 4 2
6 7 2
7 7 2
7 5 2
5 2 2

*/