612 C. Wet Shark and Flowers

C. Wet Shark and Flowers

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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⁹) — 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⁹), 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 .

Examples

Input

3 2
1 2
420 421
420420 420421

Output

4500.0

Input

3 5
1 4
2 3
11 14

Output

0.0

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₀, s₁, s₂) each shark grows:

1. (1, 420, 420420): note that s₀·s₁ = 420, s₁·s₂ = 176576400, and s₂·s₀ = 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.
2. (1, 420, 420421): now, the product s₂·s₀ is not divisible by 2. Therefore, sharks s₀ and s₂ will receive 1000 dollars, while shark s₁ will receive 2000. The total is 4000.
3. (1, 421, 420420): total is 4000
4. (1, 421, 420421): total is 0.
5. (2, 420, 420420): total is 6000.
6. (2, 420, 420421): total is 6000.
7. (2, 421, 420420): total is 6000.
8. (2, 421, 420421): total is 4000.

The expected value is .

In the second sample, no combination of quantities will garner the sharks any money.

输入：输入n，p。其中n代表区间个数，p为素数。接下来n行分别为n个区间的取值范围。

输出：每个区间可以等概率的任选一个数，如果选的这个区间和它下个区间选的数的积是p的倍数的话，则这个区间和下个区间每个可以获得1000分。求其期望。

解法：对于第i个区间它得不积分的概率：1.0-pp[i]]*pp[(i+1)%n].其中pp[i]表示第i个区间取不到p的倍数的概率。

总结：对于题意得理解和数学建模的能力有待提高，对于一个题，首先应该读懂题意，然后再判断解题方向，想清楚算法在敲代码。

AC：

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<stack>
#include<algorithm>
#include<set>
#include<queue>
using namespace std;
#define maxn 100300
#define ll __int64
double pp[maxn];
int main()
{
    double ans=0;
    ll st,ed,n,p;
    //freopen("in.txt","r",stdin);
    scanf("%I64d%I64d",&n,&p);
    for(ll i=0;i<n;i++)
    {
        scanf("%I64d%I64d",&st,&ed);
        ll ct=ed/p-st/p;
        if(st%p==0) ct++;
        pp[i]=1.0-(double)((double)(ct*1.0)/(double)(ed-st+1));
    }
    for(ll i=0;i<n;i++)
    {
        ans+=(double)(1.0-pp[i]*pp[(i+1)%n])*2000;
    }


    printf("%lf\n",ans);
}