#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=998244353;
ld inf=10000999999999900;
int main(){
    ll n,a,b;
    cin >> n >> a >> b;
    vector<ll>x(n),y(n),kk(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> x[i] >> y[i] >> kk[i];
    }
    vector<ll>two(20,1);
    for (ll i = 1; i < 20; i++)
    {
        two[i]=two[i-1]*2;
    }
    vector<vector<vector<ll>>>dp(two[n],vector<vector<ll>>(n,vector<ll>(n,-1)));
    ll ans=1;
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            if (i==j)
            {
                continue;
            }
            if (abs(x[i]-x[j])+abs(y[i]-y[j])>=a||abs(kk[i]-kk[j])>=b)
            {
                dp[two[i]+two[j]][i][j]=2;
            }
        }
    }
    for (ll i = 1; i < two[n]; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            for (ll k = 0; k < n; k++)
            {
                if (dp[i][j][k]==-1)
                {
                    continue;
                }
                for (ll l = 0; l < n; l++)
                {
                    if (i&two[l])
                    {
                        continue;
                    }
                    if (abs(kk[l]-kk[k])>=b)
                    {
                        dp[i+two[l]][k][l]=dp[i][j][k]+1;
                    }
                    if (abs(x[l]-x[j])+abs(y[l]-y[j])+abs(x[l]-x[k])+abs(y[l]-y[k])>=a)
                    {
                        dp[i+two[l]][k][l]=dp[i][j][k]+1;
                    }
                }
            }
        }
    }
    for (ll i = 0; i < two[n]; i++)
    {
        for (ll k = 0; k < n; k++)
        {
            for (ll j = 0; j < n; j++)
            {
                ans=max(ans,dp[i][k][j]);
            }
        }
    }
    cout << ans << endl;
}