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

public class Main {
	static class Edge{
		int dst;
		long dist;
		long cost;
		Edge(int dst , long d ,long c){
			this.dst = dst;
			dist = d;
			cost = c;
		}
	}
	static class Vertex{
		List<Edge> adj;
		public Vertex() {
			adj = new ArrayList<Edge>();
		}
	}
	static class State implements Comparable<State>{
		int cur;
		int silver;
		long dist;
		public State(int c , int s , long d) {
			cur = c;
			silver = s;
			dist = d;
		}
		@Override
		public int compareTo(State o) {
			return Long.compare(dist, o.dist);
		}
	}
	static int SMax = 2500;
	static long solve(Vertex vs[] , int[] C , int[] D, int S, int target){
		PriorityQueue<State> pq = new PriorityQueue<State>();
		pq.add(new State(0 , S , 0));
		long dp[][] = new long[vs.length][SMax + 1];
		for(int i = 0 ; i < dp.length ; ++i){
			Arrays.fill(dp[i], -1);
		}
		dp[0][S] = 0;
		while(!pq.isEmpty()){
			State cur = pq.poll();
//			System.out.println(cur.cur+" "+cur.silver+" "+cur.dist);
			if(cur.cur == target){
				return cur.dist;
			}
			long changeCost = D[cur.cur];
			int nchange = cur.silver + C[cur.cur];
			if(nchange > SMax){
				nchange = SMax;
			}
			if(dp[cur.cur][nchange] == -1 || dp[cur.cur][nchange] > cur.dist + changeCost){
				pq.add(new State(cur.cur , nchange , cur.dist + changeCost));
				dp[cur.cur][nchange] = cur.dist + changeCost;
			}
			for(Edge e : vs[cur.cur].adj){
				if(e.cost <= cur.silver){
					State ns = new State(e.dst, (int)(cur.silver - e.cost), cur.dist + e.dist);					
					if(dp[ns.cur][ns.silver] == -1 || dp[ns.cur][ns.silver] > ns.dist){
						pq.add(ns);
						dp[ns.cur][ns.silver] = ns.dist;
					}
				}
			}
		}
		
		return -1;
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		int S = sc.nextInt();
		if(S > SMax){
			S = SMax;
		}
		Vertex vs[] = new Vertex[N];
		for(int i = 0 ; i < N ; ++i){
			vs[i] = new Vertex();
		}

		for(int i = 0 ; i < M ; ++i){
			int U = sc.nextInt() - 1;
			int V = sc.nextInt() - 1;
			int A = sc.nextInt();
			int B = sc.nextInt();
			vs[U].adj.add(new Edge(V , B , A));
			vs[V].adj.add(new Edge(U , B , A));
		}
		int C[] = new int[N];
		int D[] = new int[N];
		for(int i = 0 ; i < N ; ++i){
			C[i] = sc.nextInt();
			D[i] = sc.nextInt();
		}
		for(int i = 1 ; i < N ; ++i){
			System.out.println(solve(vs , C , D, S , i));
		}
	}
}
