There are N cities numbered 1 to N, connected by M railroads.

You are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.

The i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes. You cannot use gold coins to pay the fare.

There is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin. The transaction takes D_i minutes for each gold coin you give. You can exchange any number of gold coins at each exchange counter.

For each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.

Constraints

* 2 \leq N \leq 50
* N-1 \leq M \leq 100
* 0 \leq S \leq 10^9
* 1 \leq A_i \leq 50
* 1 \leq B_i,C_i,D_i \leq 10^9
* 1 \leq U_i < V_i \leq N
* There is no pair i, j(i \neq j) such that (U_i,V_i)=(U_j,V_j).
* Each city t=2,...,N can be reached from City 1 with some number of railroads.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N M S
U_1 V_1 A_1 B_1
:
U_M V_M A_M B_M
C_1 D_1
:
C_N D_N


Output

For each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.

Examples

Input

3 2 1
1 2 1 2
1 3 2 4
1 11
1 2
2 5


Output

2
14


Input

4 4 1
1 2 1 5
1 3 4 4
2 4 2 2
3 4 1 1
3 1
3 1
5 2
6 4


Output

5
5
7


Input

6 5 1
1 2 1 1
1 3 2 1
2 4 5 1
3 5 11 1
1 6 50 1
1 10000
1 3000
1 700
1 100
1 1
100 1


Output

1
9003
14606
16510
16576


Input

4 6 1000000000
1 2 50 1
1 3 50 5
1 4 50 7
2 3 50 2
2 4 50 4
3 4 50 3
10 2
4 4
5 5
7 7


Output

1
3
5


Input

2 1 0
1 2 1 1
1 1000000000
1 1


Output

1000000001
import java.io.*;
import java.util.*;

public class Main {
    static PrintWriter out = new PrintWriter(System.out);
    static Scanner sc = new Scanner(System.in);
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    long mod = 2019;
    int[] child,color,count;
    long[] res;
    ArrayList<Integer>[] tree;
    public static void main(String[] args) throws IOException {
        Main main = new Main();
//        out.println(main.solve());
        main.solve();
        out.flush();
    }
    long solve(){
        int n = sc.nextInt(), m = sc.nextInt(), S = sc.nextInt();
        ArrayList<Edge>[] tree = new ArrayList[n];
        for(int i=0;i<n;i++) tree[i] = new ArrayList<>();
        for(int i=0;i<m;i++){
            int u = sc.nextInt()-1, v = sc.nextInt()-1;
            int fee = sc.nextInt();
            long time = sc.nextLong();
            tree[u].add(new Edge(v,fee,time));
            tree[v].add(new Edge(u,fee,time));
        }
        int[] c = new int[n], d= new int[n];
        for(int i=0;i<n;i++){
            c[i] = sc.nextInt(); d[i] = sc.nextInt();
        }
        int s_max = 50*n;
        long[][] dp = new long[n][s_max+1];
        long inf = Long.MAX_VALUE/10;
        for(int i=0;i<n;i++) Arrays.fill(dp[i],inf);
        S = Math.min(S,s_max);
        dp[0][S] = 0;
        PriorityQueue<State> pq = new PriorityQueue<>(5000, Comparator.comparingLong(ele->ele.res));
        pq.add(new State(0,S,0));
        while(pq.size()>0){
            State cur = pq.poll();
            if(dp[cur.pos][cur.coin]<cur.res) continue;
            // first of all, buy one coins here
            int idx = cur.pos;
            if(cur.coin<s_max){
                int target = Math.min(s_max, cur.coin+c[idx]);
                if(dp[idx][target]>cur.res+d[idx]){
                    dp[idx][target] = cur.res+d[idx];
                    pq.add(new State(idx, target, dp[idx][target]));
                }
            }
            // then go to neiboring cities
            for(Edge e:tree[idx]){
                if(e.fee>cur.coin) continue;
                int to = e.to;
                int  left = cur.coin-e.fee;
                if(dp[to][left]<=cur.res+e.time) continue;
                dp[to][left] = cur.res+e.time;
                pq.add(new State(to, left, dp[to][left]));
            }
        }
        for(int t=1;t<n;t++){
            long ans = inf;
            for(int res=0;res<=s_max;res++) ans = Math.min(ans,dp[t][res]);
            out.println(ans);
        }
        return 0;
    }
    class Edge{
        int to,fee;
        long time;
        public Edge(){}
        public Edge(int _to, int _f, long _time){
            to = _to; fee = _f; time = _time;
        }
    }
    class State{
        int pos; int coin; long res;
        public State(int p, int c, long r){
            pos = p; coin = c; res= r;
        }
    }

}

