#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using u512 = boost::multiprecision::uint512_t;

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr auto INF = u512(1) << 511;
vector<u512> dijkstra(const auto& to, int s = 0) {
  struct QueElem {
    int v;
    u512 d;
    bool operator<(const QueElem& a) const { return d > a.d; }
    QueElem(int v, u512 d) : v(v), d(d) {}
  };
  priority_queue<QueElem> q;
  vector<u512> dist(to.size(), INF);
  dist[s] = 0;
  q.emplace(s, 0);
  while (!q.empty()) {
    auto [u, d] = q.top(); q.pop();
    if (d > dist[u]) continue;
    for (auto [v, dv] : to[u]) {
      u512 nd = d + dv;
      if (nd < dist[v]) {
        dist[v] = nd;
        q.emplace(v, nd);
      }
    }
  }
  return dist;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  u512 q = 1;
  for (int i = 1; i <= 300; i++) q = lcm(q, i);
  int n, m;
  cin >> n >> m;
  vector<vector<pair<int, u512>>> to(n);
  rep(_, m) {
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    u--, v--;
    u512 w = q / b * a;
    to[u].emplace_back(v, w);
    to[v].emplace_back(u, w);
  }
  auto dist = dijkstra(to);
  rep(i, n) if (i) {
    auto p = dist[i];
    auto g = gcd(p, q);
    cout << p / g << ' ' << q / g << '\n';
  }
}