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.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.Map.Entry;

import java.util.PriorityQueue;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;


public class Main {
	
	public static class Edge {
		int from, to;
		int a;
		long b;
		
		public Edge(int from, int to, int a, long b) {
			this.from = from;
			this.to = to;
			this.a = a;
			this.b = b;
		}
	}
	
	public static class Walk implements Comparable<Walk> {
		int node;
		long time;
		long S;
		
		public Walk(int node, long time, long S) {
			this.node = node;
			this.time = time;
			this.S = S;
		}

		@Override
		public int compareTo(Walk o) {
			return Long.compare(this.time, o.time);
		}
	}
	
	public static void main(String[] args) throws IOException {	
		try(final Scanner sc = new Scanner(System.in)){
			final int N = sc.nextInt();
			final int M = sc.nextInt();
			final int S = sc.nextInt();
			
			ArrayList<HashMap<Integer, Edge>> adj = new ArrayList<HashMap<Integer, Edge>>();
			for(int i = 0; i < N; i++) { adj.add(new HashMap<Integer, Edge>()); }
			for(int i = 0; i < M; i++) {
				final int U = sc.nextInt() - 1;
				final int V = sc.nextInt() - 1;
				final int A = sc.nextInt();
				final long B = sc.nextLong();
				
				adj.get(U).put(V, new Edge(U, V, A, B));
				adj.get(V).put(U, new Edge(V, U, A, B));
			}
			
			long[] cs = new long[N];
			long[] ds = new long[N];
			
			for(int i = 0; i < N; i++) {
				cs[i] = sc.nextLong();
				ds[i] = sc.nextLong();
			}
			
			final int S_limit = N * 50;
			long[][] min_times = new long[N][S_limit + 1];
			for(int i = 0; i < N; i++) { Arrays.fill(min_times[i], Long.MAX_VALUE); }
			
			PriorityQueue<Walk> queue = new PriorityQueue<Walk>();
			queue.add(new Walk(0, 0, S));
			
			while(!queue.isEmpty()) {
				final Walk walk = queue.poll();
				
				final int estimate_S = (int)(Math.min(walk.S, S_limit));
				if(min_times[walk.node][estimate_S] <= walk.time) { continue; }
				min_times[walk.node][estimate_S] = walk.time;
				
				if(walk.S <= S_limit) {
					queue.add(new Walk(walk.node, walk.time + ds[walk.node], walk.S + cs[walk.node]));
				}
				
				for(final Entry<Integer, Edge> entry : adj.get(walk.node).entrySet()) {
					final Edge edge = entry.getValue();
					final int to = edge.to;
						
					final long next_time = walk.time + edge.b;
					final long next_S = walk.S - edge.a;
					if(next_S >= 0) { queue.add(new Walk(to, next_time, next_S)); }
				}
			}
			
			for(int i = 1; i < N; i++) {
				System.out.println(Arrays.stream(min_times[i]).min().getAsLong());
			}
		}
	}

	public static class Scanner implements Closeable {
		private BufferedReader br;
		private StringTokenizer tok;

		public Scanner(InputStream is) throws IOException {
			br = new BufferedReader(new InputStreamReader(is));
		}

		private void getLine() throws IOException {
			while(!hasNext()){
				tok = new StringTokenizer(br.readLine());
			}
		}

		private boolean hasNext() {
			return tok != null && tok.hasMoreTokens();
		}

		public String next() throws IOException {
			getLine();
			return tok.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
		

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) throws IOException {
			final int[] ret = new int[n];
			for(int i = 0; i < n; i++){
				ret[i] = this.nextInt();
			}
			return ret;
		}

		public long[] nextLongArray(int n) throws IOException {
			final long[] ret = new long[n];
			for(int i = 0; i < n; i++){
				ret[i] = this.nextLong();
			}
			return ret;
		}

		public void close() throws IOException {
			br.close();
		}
	}
}
