Problem: Silver Fox is fighting with N monsters.

The monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i.

Silver Fox can use bombs to attack the monsters. Using a bomb at the coordinate x decreases the healths of all monsters between the coordinates x-D and x+D (inclusive) by A. There is no way other than bombs to decrease the monster's health.

Silver Fox wins when all the monsters' healths become 0 or below.

Find the minimum number of bombs needed to win.

Constraints

* 1 \leq N \leq 2 \times 10^5
* 0 \leq D \leq 10^9
* 1 \leq A \leq 10^9
* 0 \leq X_i \leq 10^9
* 1 \leq H_i \leq 10^9
* X_i are distinct.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N D A
X_1 H_1
:
X_N H_N


Output

Print the minimum number of bombs needed to win.

Examples

Input

3 3 2
1 2
5 4
9 2


Output

2


Input

9 4 1
1 5
2 4
3 3
4 2
5 1
6 2
7 3
8 4
9 5


Output

5


Input

3 0 1
300000000 1000000000
100000000 1000000000
200000000 1000000000


Output

3000000000

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.TreeMap;
import java.math.BigInteger;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Sparsh Sanchorawala
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        FSilverFoxVsMonster solver = new FSilverFoxVsMonster();
        solver.solve(1, in, out);
        out.close();
    }

    static class FSilverFoxVsMonster {
        public void solve(int testNumber, InputReader s, PrintWriter w) {
            int n = s.nextInt(), d = s.nextInt(), a = s.nextInt();
            int[] x = new int[n];
            int[] h = new int[n];
            Pair[] pair = new Pair[n];
            for (int i = 0; i < n; i++) {
                x[i] = s.nextInt();
                h[i] = s.nextInt();
                pair[i] = new Pair(x[i], h[i]);
            }
            Arrays.sort(pair, new Comparator<Pair>() {

                public int compare(Pair o1, Pair o2) {
                    if (o1.x < o2.x)
                        return -1;
                    if (o1.x > o2.x)
                        return 1;
                    return 0;
                }
            });
            long res = 0;
            long add = 0;
            int curr = 0;
            TreeMap<Integer, Long> tm = new TreeMap<>();
            for (int i = 0; i < n; i++) {
                Pair p = pair[i];
                if (tm.ceilingEntry(curr) != null) {
                    curr = tm.ceilingKey(curr);
                    while (curr <= p.x) {
                        add += tm.get(curr);
                        curr++;
                        if (tm.ceilingEntry(curr) != null)
                            curr = tm.ceilingKey(curr);
                        else
                            break;
                    }
                }
                curr = pair[i].x + 1;
                BigInteger b = BigInteger.valueOf(a).multiply(BigInteger.valueOf(add));
                if (b.compareTo(BigInteger.valueOf(pair[i].h)) >= 0)
                    continue;
                long val = pair[i].h - a * add;
                int left = i, right = n - 1;
                int end = i;
                while (left <= right) {
                    int mid = (left + right) / 2;
                    if (pair[mid].x <= p.x + 2 * d) {
                        end = mid;
                        left = mid + 1;
                    } else
                        right = mid - 1;
                }
                long c = (val - 1) / a + 1;
                add += c;
                if (tm.get(p.x + 2 * d + 1) == null)
                    tm.put(p.x + 2 * d + 1, -c);
                else
                    tm.put(p.x + 2 * d + 1, tm.get(p.x + 2 * d + 1) - c);
                res += c;
            }
            w.println(res);
        }

        class Pair {
            int x;
            int h;

            Pair(int x, int h) {
                this.x = x;
                this.h = h;
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}