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

public class Main {

    private static Queue<City> queue = new PriorityQueue<City>();

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = Integer.parseInt(scan.next());
        int m = Integer.parseInt(scan.next());
        int s = Integer.parseInt(scan.next());
        // 最大銀貨数
        int maxMoney = 50 * m;
        if (s > maxMoney) {
            s = maxMoney;
        }

        // 都市作成,第一引数=都市名、第二引数=所持金
        List<List<City>> cityList = new ArrayList<List<City>>();
        for (int i = 0; i < n; i++) {
            List<City> list = new ArrayList<City>();
            for (int j = 0; j <= maxMoney; j++) {
                list.add(new City(i, j, Long.MAX_VALUE));
            }
            cityList.add(list);
        }

        List<List<Road>> roadList = new ArrayList<List<Road>>();
        for (int i = 0; i < n; i++) {
            roadList.add(new ArrayList<Road>());
        }
        for (int i = 0; i < m; i++) {
            int u = Integer.parseInt(scan.next());
            int v = Integer.parseInt(scan.next());
            int a = Integer.parseInt(scan.next());
            int b = Integer.parseInt(scan.next());
            u--;
            v--;
            roadList.get(u).add(new Road(u, v, a, b));
            roadList.get(v).add(new Road(v, u, a, b));
        }

        int[] c = new int[n];
        int[] d = new int[n];
        for (int i = 0; i < n; i++) {
            c[i] = Integer.parseInt(scan.next());
            d[i] = Integer.parseInt(scan.next());
        }
        scan.close();

        addCity(cityList.get(0).get(s), 0);
        while (!queue.isEmpty()) {
            City curCity = queue.poll();
            // 移動
            for (Road road : roadList.get(curCity.id)) {
                if (curCity.money >= road.money) {
                    addCity(cityList.get(road.to).get(curCity.money - road.money), curCity.time + road.time);
                }
            }
            // 両替
            int afterExchangedMoney = curCity.money + c[curCity.id];
            afterExchangedMoney = Math.min(afterExchangedMoney, maxMoney);
            addCity(cityList.get(curCity.id).get(afterExchangedMoney), curCity.time + d[curCity.id]);
        }

        for (int i = 1; i < n; i++) {
            long ans = Long.MAX_VALUE;
            for (City city : cityList.get(i)) {
                ans = Math.min(ans, city.time);
            }
            System.out.println(ans);
        }
    }

    private static void addCity(City city, long time) {
        if (city.time > time) {
            city.time = time;
            queue.add(city);
        }
    }

    static class City implements Comparable<City> {
        int id;
        int money;
        long time;

        public City(int id, int money, long time) {
            this.id = id;
            this.money = money;
            this.time = time;
        }

        @Override
        public int compareTo(City o) {
            if (time < o.time) {
                return -1;
            } else if (time > o.time) {
                return 1;
            } else {
                return id - o.id;
            }
        }
    }

    static class Road {
        int from;
        int to;
        int money;
        int time;

        public Road(int from, int to, int money, int time) {
            this.from = from;
            this.to = to;
            this.money = money;
            this.time = time;
        }
    }
}
