SDKD 2016 Summer Single Contest #13 .A

Little penguin Polo adores integer segments, that is, pairs of integers [l; r](l ≤ r).

He has a set that consists of n integer segments: [l1; r1], [l2; r2], …, [ln; rn]. We know that no two segments of this set intersect. In one move Polo can either widen any segment of the set 1 unit to the left or 1 unit to the right, that is transform [l; r] to either segment [l - 1; r], or to segment [l; r + 1].

The value of a set of segments that consists of n segments [l1; r1], [l2; r2], …, [ln; rn] is the number of integers x, such that there is integer j, for which the following inequality holds, lj ≤ x ≤ rj.

Find the minimum number of moves needed to make the value of the set of Polo’s segments divisible by k.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 105). Each of the following n lines contain a segment as a pair of integers li and ri ( - 105 ≤ li ≤ ri ≤ 105), separated by a space.

It is guaranteed that no two segments intersect. In other words, for any two integers i, j(1 ≤ i < j ≤ n) the following inequality holds, min(ri, rj) < max(li, lj).

Output

In a single line print a single integer — the answer to the problem.

Sample Input

Input
2 3
1 2
3 4

Output
2

Input
3 7
1 2
3 3
4 7

Output
0
题目：
一 2 b 题；
题目 读了好几遍 我都没读出来 长度 对k 取余为0

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int n, k;
int main()
{
    scanf("%d%d", &n, &k);
    int a, b;
    long long ans = 0;
    for(int i = 0; i < n; i++)
    {
        scanf("%d%d", &a, &b);
        ans += b-a+1;
    }
    if(ans % k == 0)
        printf("0\n");
    else
    {
        printf("%d", k - (ans % k));
    }
    return 0;
}