#include <bits/stdc++.h>

#define speed cin.tie(0); ios::sync_with_stdio(0)
#define cinv(v) for (auto& e : v) cin >> e;
#define all(v) v.begin(), v.end()
#define has(s, e) s.count(e)

using namespace std;
using ll = long long;
using point = array<int, 2>;

const int N_lengthS[13] = {
    0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
};

const int S_lengthS[13] = {
    0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
};

int days(int e, int h, int n) {
    if (e % 4) {
        for (int i = 1; i <= h; i++) {
            n += N_lengthS[i];
        }
    } else {
        for (int i = 1; i <= h; i++) {
            n += S_lengthS[i];
        }
    }
    return n;
}

int days_left(int e, int d) {
    return (e % 4 ? 365 : 366) - d;
}

int main() {
    speed;

    int M, E, H, N, D, DL, result = 0;
    cin >> M >> E >> H >> N;
    
    D = days(E, H, N), DL = days_left(E, D);

    for (int i = 0; i < M; i++) {
        int FE, FH, FN, FD, FDL;
        cin >> FE >> FH >> FN;

        if (abs(E - FE) > 1) continue;
        
        if (E == FE) {
            result++;
            continue;
        }

        FD = days(FE, FH, FN), FDL = days_left(FE, FD);

        if (E < FE) {
            result += (DL + FD <= 365);
            continue;
        }

        if (FE < E) {
            result += (FDL + D <= 365);
            continue;
        }
    }

    cout << result;
}