Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Watching a movie

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou have decided to watch the best moments of some movie. There are two buttons on your player:

- Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
- Skip exactly
*x*minutes of the movie (*x*is some fixed positive integer). If the player is now at the*t*-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (*t*+*x*).

Initially the movie is turned on in the player on the first minute, and you want to watch exactly *n* best moments of the movie, the *i*-th best moment starts at the *l*_{i}-th minute and ends at the *r*_{i}-th minute (more formally, the *i*-th best moment consists of minutes: *l*_{i}, *l*_{i} + 1, ..., *r*_{i}).

Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?

Input

The first line contains two space-separated integers *n*, *x* (1 ≤ *n* ≤ 50, 1 ≤ *x* ≤ 10^{5}) — the number of the best moments of the movie and the value of *x* for the second button.

The following *n* lines contain the descriptions of the best moments of the movie, the *i*-th line of the description contains two integers separated by a space *l*_{i}, *r*_{i} (1 ≤ *l*_{i} ≤ *r*_{i} ≤ 10^{5}).

It is guaranteed that for all integers *i* from 2 to *n* the following condition holds: *r*_{i - 1} < *l*_{i}.

Output

Output a single number — the answer to the problem.

Examples

Input

2 3

5 6

10 12

Output

6

Input

1 1

1 100000

Output

100000

Note

In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.

In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/18/2018 19:17:48 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|