#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;

struct Solver {
	void solve() {
        cin >> n >> k;
        vector <int> vd (n+2);

        for (int i = 0; i < n; ++i) {
            cin >> a >> b >> c >> d;
            val[a] = d;
            ve[a].push_back(b);
            ve[a].push_back(c);
            vd[b]++;
            vd[c]++;
        }
        queue<int> q;
        for (int i = 2; i < n+2; ++i) {
            if (vd[i] == 0) {
                q.push(i);
            }
        }

        while (q.size()) {
            int now = q.front(); q.pop();
            bs[now][now] = 1;
            for (int nxt : ve[now]) {
                bs[nxt] |= bs[now];
                if (--vd[nxt] == 0) {
                    q.push(nxt);
                }
            }
            for (int i = 2; i < n+2; ++i) {
                if (bs[now][i]) sum[now] += val[i];
            }
            if (now >= 2 && sum[now] >= k) {
                vans.push_back({now, sum[now]});
            }
        }

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

        sort(vans.begin(), vans.end());
        for (const auto&[x, y] : 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();
    }
}