#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
int N,M,r1,r2;
vector<array<int,4>> ed;
bool cmp(array<int,4> x, array<int,4> y) {
return r1*x[2]+r2*x[3] < r1*y[2]+r2*y[3];
}
template<int SZ> struct DSU {
int par[SZ], sz[SZ];
DSU() {
F0R(i,SZ) par[i] = i, sz[i] = 1;
}
int get(int x) { // path compression
if (par[x] != x) par[x] = get(par[x]);
return par[x];
}
bool unite(int x, int y) { // union-by-rank
x = get(x), y = get(y);
if (x == y) return 0;
if (sz[x] < sz[y]) swap(x,y);
sz[x] += sz[y], par[y] = x;
return 1;
}
};
vpi tmp;
pair<pl,vpi> ans = {{MOD,MOD},{}};
pl kruskal() {
tmp.clear();
DSU<201> D;
sort(all(ed),cmp);
ll x = 0, y = 0;
for (auto a: ed) if (D.unite(a[0],a[1])) {
tmp.pb({a[0],a[1]});
x += a[2], y += a[3];
}
return {x,y};
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> M;
F0R(i,M) {
int x,y,t,c; cin >> x >> y >> t >> c;
ed.pb({x,y,t,c});
}
F0R(i,257) F0R(j,257) if (__gcd(i,j) <= 1) {
r1 = i, r2 = j;
pl z = kruskal();
if (z.f*z.s < ans.f.f*ans.f.s) ans = {z,tmp};
}
cout << ans.f.f << " " << ans.f.s << "\n";
for (auto a: ans.s) cout << a.f << " " << a.s << "\n";
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
