E. Jinping Trains

#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x: v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x: v) out << x << ' ';
    return out;
}

void AhMeD_HoSSaM(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif
}

struct Node {

    int v, t, c, f, s;

    Node(int V = 0, int T = 0, int C = 0, int F = 0, int S = 0){
        v = V, t = T, c = C, f = F, s = S;
    }

    bool operator < (const Node& n) const {
        return t > n.t || (t == n.t && c > n.c);
    }

};

istream& operator >> (istream &in, Node& n) {
    in >> n.v >> n.t >> n.c >> n.f >> n.s;
    return in;
}

void Solve(){
    int n, m;
    cin >> n >> m;
    vector < vector < Node > > adj(n + 10);
    for(int i = 0, u; i < m && cin >> u; i++){
        Node node;
        cin >> node;
        adj[u].push_back(node);
    }
    vector < int > timee(n + 10, OO), cost(n + 10, OO);
    priority_queue < Node > dij;
    dij.push(Node(1));
    cost[1] = 0, timee[1] = 0;
    auto get_time = [&](int f, int s, int time){
        int l = 0, r = 1e8, ans = 0;
        while(l <= r){
            int mid = l + (r - l) / 2;
            (s + (mid * f) - 1 >= time ? r = mid - 1, ans = mid : l = mid + 1);
        }
        return s + (ans * f);
    };
    while(!dij.empty()){
        Node from = dij.top();
        dij.pop();
        for(auto& to : adj[from.v]){
            int target = to.t + get_time(to.f, to.s, timee[from.v]);
            if(timee[to.v] > target){
                timee[to.v] = target;
                cost[to.v] = cost[from.v] + to.c;
                dij.push(to);
            }else if(timee[to.v] == target && cost[to.v] > cost[from.v] + to.c){
                cost[to.v] = cost[from.v] + to.c;
                dij.push(to);
            }
        }
    }
    cout << timee[n] << ' ' << cost[n] << '\n';
}

int main(){
    AhMeD_HoSSaM();
    int t = 1;
    //cin >> t;
    while(t--)
        Solve();
    return 0;
}