#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using cpp_int=boost::multiprecision::cpp_int;

cpp_int Biggcd(cpp_int x, cpp_int y){
    if(y>0)return Biggcd(y,x%y);
    return x;
}

cpp_int Biglcm(cpp_int x, cpp_int y){
    return x/Biggcd(x,y)*y;
}

struct edge{
    int u,v,a,b;
};

int main(){
	std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N,M;
    cin>>N>>M;
    vector<edge> edges(M);
    cpp_int l=1;
    for(int i=0;i<M;i++){
        cin>>edges[i].u>>edges[i].v>>edges[i].a>>edges[i].b;
        edges[i].u--;
        edges[i].v--;
        l=Biglcm(edges[i].b,l);
    }
    vector<vector<pair<int, cpp_int>>> G(N);
    cpp_int INF=1;
    for(int i=0;i<M;i++){
        const cpp_int c=edges[i].a*l/edges[i].b;
        G[edges[i].u].push_back({edges[i].v, c});
        G[edges[i].v].push_back({edges[i].u, c});
        INF+=c;
    }
    priority_queue<pair<cpp_int,int>, vector<pair<cpp_int,int>>, greater<pair<cpp_int, int>>> que;
    que.push({cpp_int(0),0});
    vector<cpp_int> ans(N, INF);
    ans[0]=0;
    while(!que.empty()){
        auto [c,now]=que.top();
        que.pop();
        if(ans[now]<c){
            continue;
        }
        for(const auto& [to,cost]: G[now]){
            if(ans[to]>ans[now]+cost){
                ans[to]=ans[now]+cost;
                que.push({ans[to],to});
            }
        }
    }
    for(int i=1;i<N;i++){
        cpp_int g=Biggcd(ans[i],l);
        cout<<ans[i]/g<<" "<<l/g<<"\n";
    }
}