Codeforces Round 284 (Div. 2)
A
Watching a movie
Codeforces
1000
原题
←B →
翻译中…

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

翻译中…
  1. 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.
  2. 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.

翻译中…

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.

翻译中…

样例

Input #1
2 3
5 6
10 12
Output #1
6
InputCopy OutputCopy
Input #2
1 1
1 100000
Output #2
100000
InputCopy OutputCopy
题目信息
题号
499A
时间限制
1 s
内存限制
256 MB
标签
贪心
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。