#include <bits/stdc++.h>

using namespace std;
int n, TH;
unordered_set<int> zu[10010];

class node {
public:
    int v, next;
} edge[10010 << 4];

int head[10010], cnt, weight[10010], indegree[10010];

void add(int u, int v) {
    edge[++cnt].v = v;
    edge[cnt].next = head[u];
    head[u] = cnt;
}

void init() {
    for (int i = 0; i <= n + 1; i++) {
        zu[i].insert(i);
    }
}

void topo() {
    queue<int> q;
    for (int i = 1; i <= n + 1; i++) {
        if (indegree[i] == 0)q.push(i);
    }
    while (!q.empty()) {
        int now = q.front();
        q.pop();
        for (int i = head[now]; i; i = edge[i].next) {
            int to = edge[i].v;
            zu[to].merge(unordered_set(zu[now]));
            if (--indegree[to] == 0)q.push(to);
        }
    }
}

void output() {
    int ans = 0;
    for (int i = 2; i <= n + 1; i++) {
        int tmp = 0;
//        cout<<i<<": ";
        for (auto to: zu[i]) {
            tmp += weight[to];
        }
        if (tmp >= TH) {
            cout << i << " " << tmp << "\n";
            ans++;
        }
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> TH;
    init();
    for (int i = 1; i <= n; i++) {
        int x, y, z, w;
        cin >> x >> y >> z >> w;
        weight[x] = w;
        add(x, y);
        add(x, z);
        indegree[y]++;
        indegree[z]++;
    }
    topo();
    output();
    return 0;
}