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.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

public final class Main {

    static class Pair {
        int v;
        int money;

        Pair(int v, int money) {
            this.v = v;
            this.money = money;
        }
    }

    static class Edge {
        int to;
        int cost, dist;

        Edge(int to, int cost, int dist) {
            this.to = to;
            this.cost = cost;
            this.dist = dist;
        }
    }

    private static final long inf = 0xfffffffffffffffL;

    public static void main(String[] args) {
        final Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        final int n = in.nextInt();
        final int m = in.nextInt();
        final int s = in.nextInt();
        final List<List<Edge>> edges = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            edges.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            final int u = in.nextInt() - 1;
            final int v = in.nextInt() - 1;
            final int a = in.nextInt();
            final int b = in.nextInt();
            edges.get(u).add(new Edge(v, a, b));
            edges.get(v).add(new Edge(u, a, b));
        }
        final int[] c = new int[n];
        final long[] d = new long[n];
        for (int i = 0; i < n; i++) {
            c[i] = in.nextInt();
            d[i] = in.nextInt();
        }
        if (s >= 300) {
            final long[] t = new long[n];
            for (int i = 1; i < n; i++) {
                t[i] = inf;
            }
            final PriorityQueue<Integer> queue = new PriorityQueue<>(Comparator.comparingLong(i -> t[i]));
            queue.add(0);
            while (!queue.isEmpty()) {
                final Integer p = queue.poll();
                for (Edge edge : edges.get(p)) {
                    if (t[edge.to] > t[p] + edge.dist) {
                        t[edge.to] = t[p] + edge.dist;
                        queue.add(edge.to);
                    }
                }
            }
            for (int i = 1; i < n; i++) {
                System.out.println(t[i]);
            }
            return;
        }
        final long[][] time = new long[n][300];
        for (long[] row : time) {
            Arrays.fill(row, inf);
        }
        time[0][s] = 0;
        final PriorityQueue<Pair> queue = new PriorityQueue<>(
                Comparator.comparingLong(pair -> time[pair.v][pair.money]));
        queue.add(new Pair(0, s));
        while (!queue.isEmpty()) {
            final Pair pair = queue.poll();
            if (pair.money + c[pair.v] < 300) {
                update(pair.v, pair.money + c[pair.v], time[pair.v][pair.money] + d[pair.v], time, queue);
            }
            for (Edge edge : edges.get(pair.v)) {
                if (pair.money - edge.cost >= 0) {
                    update(edge.to, pair.money - edge.cost, time[pair.v][pair.money] + edge.dist, time, queue);
                }
            }
        }
        for (int i = 1; i < n; i++) {
            long ans = inf;
            for (int j = 0; j < 300; j++) {
                ans = Math.min(ans, time[i][j]);
            }
            System.out.println(ans);
        }
    }

    private static void update(int v, int money, long t, long[][] time, PriorityQueue<Pair> queue) {
        if (time[v][money] > t) {
            time[v][money] = t;
            queue.add(new Pair(v, money));
        }
    }
}
