#include <bits/stdc++.h>
using namespace std;
#define ll long long
#ifdef LOCAL
template<class t,class u>ostream& operator<<(ostream& os,const pair<t,u>& p){return os<<"("<<p.first<<","<<p.second<<")";}
#endif
template<class t>ostream& operator<<(ostream& os,const vector<t>& v){if(v.size())os<<v[0];for(int i=1; i<v.size(); i++)os<<' '<<v[i]; return os;}
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int n, m, t, k, a, b, c, d, cnt, mark, an, oT_To, x, y, z;
ll ans;
short val[10005], vis[10005];
int sum[10005];
bitset<10005> bs[10005];
vector <int> ve[10005];
vector <pair<int, int> > vans;
void dfs(int x) {
    for (int nxt : ve[x]) {
        if (vis[nxt]) {
            bs[x] |= bs[nxt];
            continue;
        }
        vis[nxt] = 1;
        dfs(nxt);
        bs[x] |= bs[nxt];
    }
    bs[x][x] = 1;
    for (int i = 2; i <= n+1; ++i) {
        if (bs[x][i]) sum[x] += val[i];
    }
    if (x >= 2 && sum[x] >= k) {
        vans.push_back({sum[x], x});
    }
}

struct Solver {
	void solve() {
        cin >> n >> k;
        for (int i = 0; i < n; ++i) {
            cin >> a >> b >> c >> d;
            val[a] = d;
            ve[b].push_back(a);
            ve[c].push_back(a);
        }
        ve[0].push_back(1);
        vis[0] = 1;
        dfs(0);

//        for (int i = 0; i <= n+1; ++i) {
//            cout << "sum["<<i<<"]: " << sum[i] << '\n';
//        }

        sort(vans.rbegin(), vans.rend());
        for (const auto&[y, x] : vans) {
            cout << x << ' ' << y << '\n';
        }
        cout << vans.size();
	}
};

int main () {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    oT_To = 1;
//    cin >> oT_To;
    while (oT_To--) {
    	Solver solver;
        solver.solve();
    }
}