There are $*n*$ sharks who grow flowers for Wet Shark. They are all sitting around the table, such that sharks $*i*$ and $*i* + 1$ are neighbours for all $*i*$ from $1$ to $*n* - 1$. Sharks $*n*$ and $1$ are neighbours too.
Each shark will grow some number of flowers $*s*_{*i*}$. For $*i*$-th shark value $*s*_{*i*}$ is random integer equiprobably chosen in range from $*l*_{*i*}$ to $*r*_{*i*}$. Wet Shark has it's favourite prime number $*p*$, and he really likes it! If for any pair of neighbouring sharks $*i*$ and $*j*$ the product $*s*_{*i*}·*s*_{*j*}$ is divisible by $*p*$, then Wet Shark becomes happy and gives $1000$ dollars to each of these sharks.
At the end of the day sharks sum all the money Wet Shark granted to them. Find the expectation of this value.
Input
The first line of the input contains two space-separated integers $*n*$ and $*p*$ ($3 ≤ *n* ≤ 100 000, 2 ≤ *p* ≤ 10^{9}$) — the number of sharks and Wet Shark's favourite prime number. It is guaranteed that $*p*$ is prime.
The $*i*$-th of the following $*n*$ lines contains information about $*i*$-th shark — two space-separated integers $*l*_{*i*}$ and $*r*_{*i*}$ ($1 ≤ *l*_{*i*} ≤ *r*_{*i*} ≤ 10^{9}$), the range of flowers shark $*i*$ can produce. Remember that $*s*_{*i*}$ is chosen equiprobably among all integers from $*l*_{*i*}$ to $*r*_{*i*}$, inclusive.
Output
Print a single real number — the expected number of dollars that the sharks receive in total. You answer will be considered correct if its absolute or relative error does not exceed $10^{ - 6}$.
Namely: let's assume that your answer is $*a*$, and the answer of the jury is $*b*$. The checker program will consider your answer correct, if
.
Note
A prime number is a positive integer number that is divisible only by $1$ and itself. $1$ is not considered to be prime.
Consider the first sample. First shark grows some number of flowers from $1$ to $2$, second sharks grows from $420$ to $421$ flowers and third from $420420$ to $420421$. There are eight cases for the quantities of flowers $(*s*_{0}, *s*_{1}, *s*_{2})$ each shark grows:
$(1, 420, 420420)$: note that$*s*_{0}·*s*_{1} = 420$,$*s*_{1}·*s*_{2} = 176576400$, and$*s*_{2}·*s*_{0} = 420420$. For each pair,$1000$dollars will be awarded to each shark. Therefore, each shark will be awarded$2000$dollars, for a total of$6000$dollars.$(1, 420, 420421)$: now, the product$*s*_{2}·*s*_{0}$is not divisible by$2$. Therefore, sharks$*s*_{0}$and$*s*_{2}$will receive$1000$dollars, while shark$*s*_{1}$will receive$2000$. The total is$4000$.$(1, 421, 420420)$: total is$4000$$(1, 421, 420421)$: total is$0$.$(2, 420, 420420)$: total is$6000$.$(2, 420, 420421)$: total is$6000$.$(2, 421, 420420)$: total is$6000$.$(2, 421, 420421)$: total is$4000$.
The expected value is
.
In the second sample, no combination of quantities will garner the sharks any money.
样例
3 2
1 2
420 421
420420 420421
4500.0
3 5
1 4
2 3
11 14
0.0
题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。