QBSCHOOL || DIJKSTRA

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 5005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;

int n,m;
vector<ii> a[N];
int d[N], f[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int k,u,v,z;
        cin >> k >> u >> v >> z;
        a[u].pb(ii(v,z));
        if (k==2) a[v].pb(ii(u,z));
    }
}

void dijkstra()
{
    priority_queue<ii, vii, greater<ii>>q;
    q.push(ii(0,1));
    for(int i=1; i<=n; i++) d[i] = 9999999999;
    d[1] = 0;
    f[1] = 1;
    while (q.size())
    {
        int u = q.top().se;
        int du = q.top().fi;
        q.pop();
        if (du != d[u]) continue;
        for(int i=0; i<a[u].size(); i++)
        {
            int v = a[u][i].fi;
            int uv = a[u][i].se;
            if (d[v] > d[u] + uv)
            {
                d[v] = d[u] + uv;
                f[v] = f[u];
                q.push(ii(d[v],v));
            }
            else if (d[v] == d[u] + uv) f[v] += f[u];
        }
    }
}

void proc()
{
    dijkstra();
    cout << d[n] << ' ' << f[n];
}

signed main()
{
    readfile();
    proc();
    return 0;
}