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.*;

public class Main {
	static class Route {
		int to;
		int cost;
		long time;

		public Route(int to, int cost, long time) {
			this.to = to;
			this.cost = cost;
			this.time = time;
		}
	}
	static class Graph {
		int N;
		ArrayList<ArrayList<Route>> node;
		int[] exRate;
		long[] exTime;
		
		public Graph(int N) {
			this.N = N;
			node = new ArrayList<>();
			for(int i=0; i<N; i++)
				node.add(new ArrayList<Route>());
			exRate = new int[N];
			exTime = new long[N];
		}
		
		public void addEdge(int from, int to, int cost, int time) {
			node.get(from).add(new Route(to, cost, time));
			node.get(to).add(new Route(from, cost, time));
		}
		
		public void addEx(int i, int rate, int time) {
			exRate[i] = rate;
			exTime[i] = time;
		}
	}
	
	static class Path {
		int to;
		int have;
		long time;
		public Path(int to, int have, long time) {
			this.to = to;
			this.have = have;
			this.time = time;
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int M = sc.nextInt();
		int S = sc.nextInt();
		
		Graph g = new Graph(N);
		for(int i=0; i<M; i++) {
			g.addEdge(sc.nextInt()-1, sc.nextInt()-1, sc.nextInt(), sc.nextInt());
		}
		for(int i=0; i<N; i++) {
			g.addEx(i, sc.nextInt(), sc.nextInt());
		}
		
		int maxCost = (N-1)*50;
		if(S>maxCost)
			S = maxCost;
		final long INF = (long)1e20;
		long[][] time = new long[N][maxCost+1];
		for(int i=0; i<N; i++)
			Arrays.fill(time[i], INF);
		
		LinkedList<Path> q = new LinkedList<>();
		q.add(new Path(0, S, 0));
		
		while(!q.isEmpty()) {
			Path p = q.poll();
			if(time[p.to][p.have] <= p.time)
				continue;
			time[p.to][p.have] = p.time;
			for(Route r : g.node.get(p.to)) {
				int next = r.to;
				int have = p.have-r.cost;
				if(have<0)
					continue;
				long t = p.time + r.time;
				if(time[next][have]>t)
					q.add(new Path(next, have, t));
			}
			
			int afterCoin = Math.min(p.have + g.exRate[p.to], maxCost);
			long afterTime = p.time + g.exTime[p.to];
			if(time[p.to][afterCoin] > afterTime) {
				q.add(new Path(p.to, afterCoin, afterTime));
			}
		}
		
		for(int i=1; i<N; i++) {
			long min = Long.MAX_VALUE;
			for(int j=0; j<maxCost; j++) {
				min = Math.min(min, time[i][j]);
			}
			System.out.println(min);
		}
		
		sc.close();
	}
}

