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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.AbstractCollection;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Sparsh Sanchorawala
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ETwoCurrencies solver = new ETwoCurrencies();
        solver.solve(1, in, out);
        out.close();
    }

    static class ETwoCurrencies {
        public void solve(int testNumber, InputReader s, PrintWriter w) {
            int k = 2500;
            int n = s.nextInt(), m = s.nextInt(), coins = Math.min(s.nextInt(), k - 1);
            ArrayList<Integer>[] adj = new ArrayList[n];
            for (int i = 0; i < n; i++)
                adj[i] = new ArrayList<>();
            Edge[] edge = new Edge[m];
            for (int i = 0; i < m; i++) {
                edge[i] = new Edge(s.nextInt() - 1, s.nextInt() - 1, s.nextInt(), s.nextInt());
                adj[edge[i].u].add(i);
                adj[edge[i].v].add(i);
            }
            int[] c = new int[n];
            int[] d = new int[n];
            for (int i = 0; i < n; i++) {
                c[i] = s.nextInt();
                d[i] = s.nextInt();
            }
            PriorityQueue<Pair> pq = new PriorityQueue<>(new Comparator<Pair>() {

                public int compare(Pair p1, Pair p2) {
                    if (p1.t < p2.t)
                        return -1;
                    if (p1.t > p2.t)
                        return 1;
                    return 0;
                }
            });
            pq.add(new Pair(0, coins, 0L));
            int[][] vis = new int[n][k];
            long[][] dist = new long[n][k];
            for (int i = 0; i < n; i++)
                Arrays.fill(dist[i], Long.MAX_VALUE);
            dist[0][coins] = 0;
            while (!pq.isEmpty()) {
                Pair p = pq.poll();
                if (vis[p.i][p.c] == 1)
                    continue;
                vis[p.i][p.c] = 1;
                if (p.c + 1 < k) {
                    int next = Math.min(k - 1, p.c + c[p.i]);
                    if (dist[p.i][next] > dist[p.i][p.c] + d[p.i]) {
                        dist[p.i][next] = dist[p.i][p.c] + d[p.i];
                        pq.add(new Pair(p.i, next, dist[p.i][next]));
                    }
                }
                for (int e : adj[p.i]) {
                    int u = p.i;
                    int v = edge[e].other(u);
                    if (p.c >= edge[e].c && dist[v][p.c - edge[e].c] > dist[u][p.c] + edge[e].t) {
                        dist[v][p.c - edge[e].c] = dist[u][p.c] + edge[e].t;
                        pq.add(new Pair(v, p.c - edge[e].c, dist[v][p.c - edge[e].c]));
                    }
                }
            }
            long[] res = new long[n];
            Arrays.fill(res, Long.MAX_VALUE);
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < k; j++)
                    res[i] = Math.min(dist[i][j], res[i]);
            }
            for (int i = 1; i < n; i++)
                w.println(res[i]);
        }

        class Pair {
            int i;
            int c;
            long t;

            Pair(int i, int c, long t) {
                this.i = i;
                this.c = c;
                this.t = t;
            }

        }

        class Edge {
            int u;
            int v;
            int c;
            int t;

            Edge(int u, int v, int c, int t) {
                this.u = u;
                this.v = v;
                this.c = c;
                this.t = t;
            }

            int other(int x) {
                return (x == u) ? v : u;
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

