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.util.*;
import java.util.stream.*;

public class Main {
    static final int MAX_V = 50;
    static final int MAX_S = MAX_V * 50 + 5;

    @SuppressWarnings("unchecked")
    static List<Edge>[] g = new ArrayList[MAX_V];
    static long[][] dist = new long[MAX_V][MAX_S + 5];

    static {
        for (int i = 0; i < MAX_V; i++) {
            g[i] = new ArrayList<>();
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int cities = sc.nextInt();
        int lines = sc.nextInt();
        int silvers = sc.nextInt();
        for (int i = 0; i < lines; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            int fare = sc.nextInt();
            int minutes = sc.nextInt();
            --u; --v;
            g[u].add(new Edge(v, fare, minutes));
            g[v].add(new Edge(u, fare, minutes));
        }
        List<Integer> c = new ArrayList<>(cities), d = new ArrayList<>(cities);
        for (int i = 0; i < cities; i++) {
            c.add(sc.nextInt());
            d.add(sc.nextInt());
        }
        for (int i = 0; i < cities; i++) {
            for (int j = 0; j < MAX_S + 5; j++) {
                dist[i][j] = Long.MAX_VALUE;
            }
        }
        silvers = Integer.min(silvers, MAX_S);

        PriorityQueue<Data> q = new PriorityQueue<>((a, b) -> {
            long diff = a.x - b.x;
            if (diff > 0) return 1;
            if (diff < 0) return -1;
            return 0;
        });
        TriConsumer<Integer, Integer, Long> push = (v, s, x) -> {
            if (s < 0) return;
            if (dist[v][s] <= x) return;
            dist[v][s] = x;
            q.add(new Data(v, s, x));
        };
        push.accept(0, silvers, 0L);
        while (!q.isEmpty()) {
            Data top = q.poll();
            int v = top.v, s = top.s;
            long x = top.x;
            if (dist[v][s] != x) continue;
            {
                int ns = Integer.min(s + c.get(v), MAX_S);
                push.accept(v, ns, x + d.get(v));
            }
            for (Edge e : g[v]) {
                push.accept(e.to, s - e.a, x + e.b);
            }
        }
        for (int i = 1; i < cities; i++) {
            long ans = Long.MAX_VALUE;
            for (int j = 0; j < MAX_S + 5; j++) {
                ans = Long.min(ans, dist[i][j]);
            }
            System.out.println(ans);
        }
    }

    private static class Edge {
        int to, a, b;
        Edge(int to, int a, int b) {
            this.to = to;
            this.a = a;
            this.b = b;
        }
    }

    private static class Data {
        int v, s;
        long x;
        Data(int v, int s, long x) {
            this.v = v;
            this.s = s;
            this.x = x;
        }
    }
}

interface TriConsumer<T, U, V> {
    void accept(T t, U u, V v);
}
