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.Arrays;
import java.util.TreeSet;

public class Main {

  private static void solve() {
    int n = ni();
    int m = ni();
    int s = ni();

    int[] from = new int[m];
    int[] to = new int[m];
    int[] a = new int[m];
    int[] b = new int[m];
    for (int i = 0; i < m; i++) {
      from[i] = ni() - 1;
      to[i] = ni() - 1;
      a[i] = ni();
      b[i] = ni();
    }
    long[] c = new long[n];
    long[] d = new long[n];
    for (int i = 0; i < n; i++) {
      c[i] = ni();
      d[i] = ni();
    }
    int[][][] g = packWU(n, from, to, a, b);

    long[][] ret = dijk(g, new int[] {0, Math.min(2500, s)}, c, d);

    for (int i = 1; i < n; i++) {
      long ans = Long.MAX_VALUE;
      for (int j = 0; j <= 2500; j++) {
        ans = Math.min(ans, ret[i][j]);
      }
      out.println(ans + " ");
    }
  }

  public static long[][] dijk(int[][][] g, int[] from, long[] c, long[] d) {
    int n = g.length;
    int max = 2500;
    final long[][] td = new long[n][3000];
    for (long[] v : td)
      Arrays.fill(v, Long.MAX_VALUE);

    TreeSet<int[]> q = new TreeSet<>((a, b) -> {
      if (td[a[0]][a[1]] - td[b[0]][b[1]] != 0)
        return Long.signum(td[a[0]][a[1]] - td[b[0]][b[1]]);
      return a[0] == b[0] ? a[1] - b[1] : a[0] - b[0];
    });

    q.add(from);
    td[from[0]][from[1]] = 0;

    while (q.size() > 0) {
      int[] v = q.pollFirst();
      int cur = v[0];
      int s = v[1];
      for (int i = 0; i < g[cur].length; i++) {
        int u = g[cur][i][0];
        int cost = g[cur][i][1];
        long time = g[cur][i][2];

        if (s >= cost) {
          long nd = td[cur][s] + time;
          int[] next = {u, s - cost};
          if (nd < td[next[0]][next[1]]) {
            q.remove(next);
            td[next[0]][next[1]] = nd;
            q.add(next);
          }
        }

        int nexCos = Math.min(max, (int) (s + c[cur]));
        int[] next = {cur, nexCos};
        long nd = td[cur][s] + d[cur];
        if (nd < td[next[0]][next[1]]) {
          q.remove(next);
          td[next[0]][next[1]] = nd;
          q.add(next);
        }
      }
    }

    return td;

  }


  public static int[][][] packWU(int n, int[] from, int[] to, int[] a, int[] b) {
    int[][][] g = new int[n][][];
    int[] p = new int[n];
    for (int f : from)
      p[f]++;
    for (int t : to)
      p[t]++;
    for (int i = 0; i < n; i++)
      g[i] = new int[p[i]][3];
    for (int i = 0; i < from.length; i++) {
      --p[from[i]];
      g[from[i]][p[from[i]]][0] = to[i];
      g[from[i]][p[from[i]]][1] = a[i];
      g[from[i]][p[from[i]]][2] = b[i];
      --p[to[i]];
      g[to[i]][p[to[i]]][0] = from[i];
      g[to[i]][p[to[i]]][1] = a[i];
      g[to[i]][p[to[i]]][2] = b[i];
    }
    return g;
  }


  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}

