x += x & (-x)

a.sort((o1, o2) -> {
    if (o1[0] != o2[0]) {
        return Integer.compare(o1[0], o2[0]);
    } else {
        return Integer.compare(o1[1], o2[1]);
    }
});


for (int[] rect : a) {
    int l = rect[0], w = rect[1], c = rect[2];
    for (int i = 0; i < 3; i++) {
        if (i != c) {
            ans += tr[i].rangeSum(w, M);
            ans %= mod;
        }
    }
    tr[c].add(w, 1);
}

int rangeSum(int l, int r) {
    return sum(r) - sum(l);
}

int sum(int x) {
    int ans = 0;
    for (; x > 0; x -= x & (-x)) {
        ans += tree[x];
    }
    return ans;
}

void add(int x, int val) {
    for (; x <= n; x += x & (-x)) {
        tree[x] += val;
    }
}