Problem: There is a railroad in Takahashi Kingdom. The railroad consists of N sections, numbered 1, 2, ..., N, and N+1 stations, numbered 0, 1, ..., N. Section i directly connects the stations i-1 and i. A train takes exactly A_i minutes to run through section i, regardless of direction. Each of the N sections is either single-tracked over the whole length, or double-tracked over the whole length. If B_i = 1, section i is single-tracked; if B_i = 2, section i is double-tracked. Two trains running in opposite directions can cross each other on a double-tracked section, but not on a single-tracked section. Trains can also cross each other at a station.

Snuke is creating the timetable for this railroad. In this timetable, the trains on the railroad run every K minutes, as shown in the following figure. Here, bold lines represent the positions of trains running on the railroad. (See Sample 1 for clarification.)

<image>

When creating such a timetable, find the minimum sum of the amount of time required for a train to depart station 0 and reach station N, and the amount of time required for a train to depart station N and reach station 0. It can be proved that, if there exists a timetable satisfying the conditions in this problem, this minimum sum is always an integer.

Formally, the times at which trains arrive and depart must satisfy the following:

* Each train either departs station 0 and is bound for station N, or departs station N and is bound for station 0.
* Each train takes exactly A_i minutes to run through section i. For example, if a train bound for station N departs station i-1 at time t, the train arrives at station i exactly at time t+A_i.
* Assume that a train bound for station N arrives at a station at time s, and departs the station at time t. Then, the next train bound for station N arrives at the station at time s+K, and departs the station at time t+K. Additionally, the previous train bound for station N arrives at the station at time s-K, and departs the station at time t-K. This must also be true for trains bound for station 0.
* Trains running in opposite directions must not be running on the same single-tracked section (except the stations at both ends) at the same time.

Constraints

* 1 \leq N \leq 100000
* 1 \leq K \leq 10^9
* 1 \leq A_i \leq 10^9
* A_i is an integer.
* B_i is either 1 or 2.

Input

The input is given from Standard Input in the following format:


N K
A_1 B_1
A_2 B_2
:
A_N B_N


Output

Print an integer representing the minimum sum of the amount of time required for a train to depart station 0 and reach station N, and the amount of time required for a train to depart station N and reach station 0. If it is impossible to create a timetable satisfying the conditions, print -1 instead.

Examples

Input

3 10
4 1
3 1
4 1


Output

26


Input

1 10
10 1


Output

-1


Input

6 4
1 1
1 1
1 1
1 1
1 1
1 1


Output

12


Input

20 987654321
129662684 2
162021979 1
458437539 1
319670097 2
202863355 1
112218745 1
348732033 1
323036578 1
382398703 1
55854389 1
283445191 1
151300613 1
693338042 2
191178308 2
386707193 1
204580036 1
335134457 1
122253639 1
824646518 2
902554792 2


Output

14829091348

Solution (in CPP):

Solution:
#include<bits/stdc++.h> 
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
typedef long long ll;
using namespace std;
inline int read(){
	int n=0,f=1;char c;
	for(c=getchar();(c<'0'||c>'9')&&c!='-';c=getchar());
	if (c=='-') c=getchar(),f=-1;
	for(;c>='0'&&c<='9';c=getchar()) n=n*10+c-48;
	return n*f;
}
const int maxn=2e5+5;
int i,j,n,k,now,l[maxn],r[maxn];ll ans,sum,f[maxn];
int v[maxn],m,bz[maxn<<2];
void ch(int k,int l,int r,int x,int y){
	if (x>y) return;
	if (l==x&&r==y) {bz[k]=i;return;}
	int m=(l+r)>>1,lk=k<<1,rk=lk+1;
	if (bz[k]) bz[lk]=bz[rk]=bz[k],bz[k]=0;
	if (y<=m) ch(lk,l,m,x,y);else
	if (x>m) ch(rk,m+1,r,x,y);else
	ch(lk,l,m,x,m),ch(rk,m+1,r,m+1,y);
}
int find(int k,int l,int r,int x){
	if (bz[k]||l==r) return bz[k];
	int m=(l+r)>>1,lk=k<<1,rk=lk+1;
	return (x<=m)?find(lk,l,m,x):find(rk,m+1,r,x);
}
ll Ans(int x){
	int y=find(1,1,m,x);
	return y?f[y]+(v[l[y]]-v[x]+k)%k:0;
}
int main(){
	n=read(),k=read();
	sum=now=0;
	fo(i,1,n){
		int a=read(),b=read();
		a<<=1,sum+=a;
		if (b==1&&a>k)return puts("-1"),0;
		a=(now-a%k+k)%k;
		if (b==1) l[i]=now,r[i]=a;else l[i]=0,r[i]=k-1;
		now=a;
	}
	fo(i,1,n) v[++m]=l[i],v[++m]=r[i];
	sort(v+1,v+m+1);
	m=unique(v+1,v+m+1)-v-1;
	fd(i,n,1){
		l[i]=lower_bound(v+1,v+m+1,l[i])-v;
		r[i]=lower_bound(v+1,v+m+1,r[i])-v;
		f[i]=Ans(l[i]);
		if (l[i]>r[i]) ch(1,1,m,r[i]+1,l[i]-1);
		else ch(1,1,m,1,l[i]-1),ch(1,1,m,r[i]+1,m);
	}
	ans=f[1];
	fo(i,1,m) ans=min(ans,Ans(i));
	printf("%lld\n",sum+ans);
}