#include <bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5;
vector<int> g[N];
int wei[N], in[N], tot[N];
int par[N][N];

void solve() {
  int n, th; cin >> n >> th;
  for (int i = 0; i < n; i++) {
    int x, y, z, w; cin >> x >> y >> z >> w;
    g[x].push_back(y);
    g[x].push_back(z);
    wei[x] = w;
    in[y]++;
    in[z]++;
  }
  queue<int> q;
  for (int i = 0; i <= n + 1; ++i) {
    if (in[i] == 0) q.push(i);
  }
  vector<int> res;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : g[u]) {
      for (int i = 0; i <= n + 1; i++) {
        if (par[u][i]) par[v][i] = 1;
        par[v][u] = 1;
      }
      q.push(v);
    }
  }
  for (int i = 0; i <= n + 1; ++i) {
    tot[i] = wei[i];
    for (int j = 0; j <= n + 1; ++j) {
      tot[i] += (par[i][j] ? wei[j] : 0);
    }
  }
  for (int i = 2; i <= n; i++) {
    if (tot[i] >= th) {
      res.push_back(i);
    }
  }
  int sz = (int)res.size();
  for (int x : res) {
    cout << x << " " << tot[x] << "\n";
  }
  cout << sz << "\n";
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  // cin >> T;
  while (T--) solve();
}