#include<bits/stdc++.h>
using namespace std;
const int N = 10005;
int w[N];
int d[N];
vector<int> graph[N];
bitset<N> have[N];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, th;
    cin >> n >> th;
    graph[1].push_back(0);
    int x, y, z;
    d[0] += 1;
    for(int i = 0; i < n; i++){
        cin >> x >> y >> z;
        cin >> w[x];
        graph[x].push_back(y);
        graph[x].push_back(z);
        d[y] += 1;
        d[z] += 1;
    }
    queue<int> que;
    for(int i = 0; i <= n + 1; i++){
        have[i] |= (1 << i);
        if(d[i] == 0){
            que.push(i);
        }
    }
    while(!que.empty()){
        int top = que.front();
        que.pop();
        for(auto i : graph[top]){
            have[i] |= have[top];
            d[i]--;
            if(d[i] == 0){
                que.push(i);
            }
        }
    }
    int cnt = 0;
    for(int i = 2; i <= n + 1; i++){
        int sum = 0;
        for(int j = 0; j <= n + 1; j++){
            if(have[i][j])
                sum += w[j];
        }
        if(sum >= th){
            cnt++;
            cout << i << ' ' << sum << '\n';
        }
    }
    cout << cnt << '\n';
}