#include<bits/stdc++.h>
#define int long long
#define N 10004
using namespace std;


vector<int> edge[N], cw(N), w(N), in(N);
int vis[N];

void dfs(int u, int x){
    if(vis[u]) return;
    vis[u] = 1;
    cw[u] += x;
    for(auto v : edge[u]){
        dfs(v, x);
    }
}

signed main(){
    ios_base::sync_with_stdio(0), cin.tie(0);

    edge[1].push_back(0);
    in[0]++;
    int n, m, th; cin >> m >> th;
    n = m + 1;
    while(m--){
        int x, y, z; cin >> x >> y >> z >> w[x];
        edge[x].push_back(y);
        edge[x].push_back(z);
        in[y]++, in[z]++;
    }
    queue<int> q;
    for(int i = 0; i <= n; i++){
        if(in[i] == 0) q.push(i);
    }
    
    while(!q.empty()){
        int u = q.front(); q.pop();
        memset(vis, 0, sizeof(vis));
        dfs(u, w[u]);
        for(auto v : edge[u]){
            in[v]--;
            if(in[v] == 0) q.push(v);
        }
    }
    int cnt = 0;
    for(int i = 2; i <= n; i++){
        if(cw[i] > th){
            cout << i << " " << cw[i] << '\n';
            cnt++;
        }
    }
    cout << cnt;

    return 0;
}