跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2501. Polo the Penguin and Segments

  • ID: 2507
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 枚举
  • 模拟
  • 算法思想
  • 编程与模拟
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Polo the Penguin and Segments

题目描述

A. Polo the Penguin and Segments
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
Input
2 3
1 2
3 4
Output
2
Input
3 7
1 2
3 3
4 7
Output
0

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2139 题。保留原作者与原赛事署名。