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.List;
import java.util.PriorityQueue;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int m = Integer.parseInt(sa[1]);
		int ss = Integer.parseInt(sa[2]);
		List<List<Hen>> list = new ArrayList<>(n);
		for (int i = 0; i < n; i++) {
			list.add(new ArrayList<>());
		}
		for (int i = 0; i < m; i++) {
			sa = br.readLine().split(" ");
			int u = Integer.parseInt(sa[0]) - 1;
			int v = Integer.parseInt(sa[1]) - 1;
			int a = Integer.parseInt(sa[2]);
			int b = Integer.parseInt(sa[3]);

			list.get(u).add(new Hen(v, a, b));
			list.get(v).add(new Hen(u, a, b));
		}
		int[] c = new int[n];
		int[] d = new int[n];
		for (int i = 0; i < n; i++) {
			sa = br.readLine().split(" ");
			c[i] = Integer.parseInt(sa[0]);
			d[i] = Integer.parseInt(sa[1]);
		}
		br.close();

		int total = 2500;
		long[][] ans = new long[n][total + 1];
		for (int i = 0; i < n; i++) {
			Arrays.fill(ans[i], Long.MAX_VALUE);
		}
		int e = Math.min(ss, total);
		for (int i = 0; i <= e; i++) {
			ans[0][i] = 0;
		}

		PriorityQueue<Node> que = new PriorityQueue<Node>();
		Node first = new Node(0, 0, e);
		que.add(first);
		while (!que.isEmpty()) {
			Node cur = que.poll();
			for (Hen hen : list.get(cur.v)) {
				if (cur.s >= hen.a) {
					long alt = ans[cur.v][cur.s] + hen.b;
					int rem = cur.s - hen.a;
					if (alt < ans[hen.v][rem]) {
						ans[hen.v][rem] = alt;
						que.add(new Node(hen.v, alt, rem));
					}
				}
			}
			int gin = cur.s;
			long alt = ans[cur.v][cur.s];
			if (gin < total) {
				gin = Math.min(gin + c[cur.v], total);
				alt += d[cur.v];
				if (alt < ans[cur.v][gin]) {
					ans[cur.v][gin] = alt;
					que.add(new Node(cur.v, alt, gin));
				}
			}
		}

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

	static class Hen {
		int v, a, b;

		public Hen(int v, int a, int b) {
			this.v = v;
			this.a = a;
			this.b = b;
		}
	}

	static class Node implements Comparable<Node> {
		int v;
		long d;
		int s;

		public Node(int v, long d, int s) {
			this.v = v;
			this.d = d;
			this.s = s;
		}

		public int compareTo(Node o) {
			if (d != o.d) {
				return Long.compare(d, o.d);
			}
			return Long.compare(o.s, s);
		}
	}
}
