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

public class Main {
	public static void main (String[] args) { new Main(); }

	public Main() {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		System.err.println("");

		int n = fs.nextInt(), m = fs.nextInt(), init = fs.nextInt();
		ArrayList<Edge>[] adj = new ArrayList[n];
		for(int i = 0; i < n; i++) adj[i] = new ArrayList<>();
		
		for(int i = 0; i < m; i++) {
			int u = fs.nextInt()-1, v = fs.nextInt()-1;
			int w1 = fs.nextInt(), w2 = fs.nextInt();
			adj[u].add(new Edge(v, w1, w2));
			adj[v].add(new Edge(u, w1, w2));
		}

		int[] per = new int[n];
		long[] time = new long[n];
		for(int i = 0; i < n; i++) {
			per[i] = fs.nextInt();
			time[i] = fs.nextLong();
		}
		
		if(init > 5000) init = 5000;
		
		long oo = (long)1e18;
		long[][] dist = new long[n][5050];
		for(long[] d : dist) Arrays.fill(d, oo);
		
		dist[0][init] = 0;
		PriorityQueue<Node> pq = new PriorityQueue<>();
		pq.add(new Node(0, init, 0));
		
		while(!pq.isEmpty()) {
			
			Node now = pq.poll();
			if(now.dist != dist[now.idx][now.coin]) continue;
			
			//buy coins?
			{
				int nCoin = now.coin+per[now.idx];
				if(nCoin > 5000) nCoin = 5000;
				long nTime = now.dist+time[now.idx];
				if(nTime < dist[now.idx][nCoin]) {
					dist[now.idx][nCoin] = nTime;
					pq.add(new Node(now.idx, nCoin, nTime));
				}
			}
			
			for(Edge e : adj[now.idx]) { 
				if(now.coin < e.w1) continue;
				long nTime = now.dist+e.w2;
				int nCoin = now.coin - e.w1;
				
				if(dist[e.to][nCoin] > nTime) {
					dist[e.to][nCoin] = nTime;
					pq.add(new Node(e.to, nCoin, nTime));
				}
			}
		}
		
		for(int i = 1; i < n; i++) {
			long min = oo;
			for(int j = 0; j <= 5000; j++) {
				min = Math.min(min, dist[i][j]);
			}
			out.println(min);
		}
		
		out.close();
	}
	
	class Node implements Comparable<Node> {
		int idx, coin;
		long dist;
		Node(int i, int c, long d) {
			idx = i; coin = c; dist = d;
		}
		public int compareTo(Node n) {
			return Long.compare(dist, n.dist);
		}
	}

	class Edge {
		int to, w1, w2;
		Edge(int a, int b, int c) {
			to = a; w1 = b; w2 = c;
		}
	}
	
	class FastScanner {
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public FastScanner() {
			in = new BufferedInputStream(System.in, BS);
		}

		public FastScanner(String s) {
			try {
				in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
			}
			catch (Exception e) {
				in = new BufferedInputStream(System.in, BS);
			}
		}

		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}                
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}

		public int nextInt() {
			return (int)nextLong();
		}

		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for(int i = 0; i < n; i++) res[i] = nextInt();
			return res;
		}
		
	}

}