#include <iostream>
#include <vector>
#include <bitset>
#include <queue>

using namespace std;

const int MAX_N = 10010;
bitset<MAX_N> approved_by[MAX_N]; // Stores which transactions approve the current transaction
int own_weight[MAX_N];            // Stores the own weight of each transaction
int cumulative_weight[MAX_N];     // Stores the cumulative weight of each transaction

int main() {
    int n, threshold;
    cin >> n >> threshold;

    for (int i = 2; i <= n + 1; ++i) {
        int x, y, z, wx;
        cin >> x >> y >> z >> wx;

        own_weight[x] = wx;
        approved_by[x][x] = 1;
        approved_by[x] |= approved_by[y];
        approved_by[x] |= approved_by[z];
    }

    int confirmed_count = 0;
    for (int i = 2; i <= n + 1; ++i) {
        cumulative_weight[i] = own_weight[i];
        for (int j = approved_by[i]._Find_first(); j < MAX_N; j = approved_by[i]._Find_next(j)) {
            if (j != i) {
                cumulative_weight[i] += own_weight[j];
            }
        }

        if (cumulative_weight[i] >= threshold) {
            cout << i << " " << cumulative_weight[i] << endl;
            confirmed_count++;
        }
    }

    cout << confirmed_count << endl;

    return 0;
}