#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1000000007;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}

int main(void){
	llint n,K,i,j,L,R,h;cin>>n>>K;
	vector<llint>wa(n+1);
	vector<int>sen(n);
	for(i=0;i<n;i++){
		llint A;int B;cin>>A>>B;A*=2;
		if(A>K&&B==1){cout<<"-1\n";return 0;}
		wa[i+1]=wa[i]+A;
		sen[i]=B;
	}
	vector<llint>atu(n+2);
	for(i=0;i<=n;i++){atu[i]=wa[i]%K;}
	atu[n+1]=K;
	SO(atu);
	vector<int>seg(262144,-1);
	vector<llint>dp(n);
	llint Kbig=big-big%K;
	for(i=0;i<n;i++){
		if(sen[i]==2){continue;}
		//自分のsegを調べる
		int sta=LBI(atu,wa[i+1]%K);
		int mae=LBI(atu,wa[i]%K);
		//cerr<<"mast"<<mae<<sta<<endl;
		//staのsegを調べる
		int bas=131072+sta;
		int dco=-1;
		while(bas>1){
			if(seg[bas]!=-1){dco=seg[bas];}
			bas/=2;
		}
		if(dco==-1){dp[i]=0;}
		else{dp[i]=dp[dco]+(Kbig+wa[dco+1]-wa[i+1])%K;}
		//mae超過sta以下の区間を上書きする
		if(mae<sta){
			sta++;
			//通常
			L=1,R=1;
			for(h=16;h>=0;h--){
				if(seg[L]!=-1){seg[L+L]=seg[L];seg[L+L+1]=seg[L];}
				if(seg[R]!=-1){seg[R+R]=seg[R];seg[R+R+1]=seg[R];}
				seg[L]=-1;seg[R]=-1;
				L*=2;R*=2;
				if(mae&(1<<h)){L++;}
				if(sta&(1<<h)){R++;}
				if(L+1<R){
					if(L%2==0){seg[L+1]=i;}
					if(R%2==1){seg[R-1]=i;}
				}
			}
		}else{
			sta++;
			//一周
			L=1,R=1;
			for(h=16;h>=0;h--){
				if(seg[L]!=-1){seg[L+L]=seg[L];seg[L+L+1]=seg[L];}
				if(seg[R]!=-1){seg[R+R]=seg[R];seg[R+R+1]=seg[R];}
				seg[L]=-1;seg[R]=-1;
				L*=2;R*=2;
				if(mae&(1<<h)){L++;}
				if(sta&(1<<h)){R++;}
				if(L%2==0){seg[L+1]=i;}
				if(R%2==1){seg[R-1]=i;}
			}
		}
		//上書き完了
	}
	//for(i=0;i<n;i++){cerr<<dp[i]<<endl;}
	for(i=1;i<131072;i++){if(seg[i]<0){continue;}seg[i+i]=seg[i];seg[i+i+1]=seg[i];}
	llint ans=big;
	for(i=0;i<=n;i++){
		if(i>0&&atu[i-1]==atu[i]){continue;}
		int ter=seg[i+131072];
		if(ter==-1){ans=0;break;}
		mineq(ans,dp[ter]+(Kbig+wa[ter+1]-atu[i])%K);
		//cerr<<"i="<<i<<"t="<<ter<<"wa="<<wa[ter+1]<<"atu="<<atu[i]<<endl;
	}
	ans+=wa[n];
	cout<<ans<<endl;
	return 0;
}
### Prompt

In Cpp, your task is to solve the following 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

### Response

```cpp
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1000000007;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}

int main(void){
	llint n,K,i,j,L,R,h;cin>>n>>K;
	vector<llint>wa(n+1);
	vector<int>sen(n);
	for(i=0;i<n;i++){
		llint A;int B;cin>>A>>B;A*=2;
		if(A>K&&B==1){cout<<"-1\n";return 0;}
		wa[i+1]=wa[i]+A;
		sen[i]=B;
	}
	vector<llint>atu(n+2);
	for(i=0;i<=n;i++){atu[i]=wa[i]%K;}
	atu[n+1]=K;
	SO(atu);
	vector<int>seg(262144,-1);
	vector<llint>dp(n);
	llint Kbig=big-big%K;
	for(i=0;i<n;i++){
		if(sen[i]==2){continue;}
		//自分のsegを調べる
		int sta=LBI(atu,wa[i+1]%K);
		int mae=LBI(atu,wa[i]%K);
		//cerr<<"mast"<<mae<<sta<<endl;
		//staのsegを調べる
		int bas=131072+sta;
		int dco=-1;
		while(bas>1){
			if(seg[bas]!=-1){dco=seg[bas];}
			bas/=2;
		}
		if(dco==-1){dp[i]=0;}
		else{dp[i]=dp[dco]+(Kbig+wa[dco+1]-wa[i+1])%K;}
		//mae超過sta以下の区間を上書きする
		if(mae<sta){
			sta++;
			//通常
			L=1,R=1;
			for(h=16;h>=0;h--){
				if(seg[L]!=-1){seg[L+L]=seg[L];seg[L+L+1]=seg[L];}
				if(seg[R]!=-1){seg[R+R]=seg[R];seg[R+R+1]=seg[R];}
				seg[L]=-1;seg[R]=-1;
				L*=2;R*=2;
				if(mae&(1<<h)){L++;}
				if(sta&(1<<h)){R++;}
				if(L+1<R){
					if(L%2==0){seg[L+1]=i;}
					if(R%2==1){seg[R-1]=i;}
				}
			}
		}else{
			sta++;
			//一周
			L=1,R=1;
			for(h=16;h>=0;h--){
				if(seg[L]!=-1){seg[L+L]=seg[L];seg[L+L+1]=seg[L];}
				if(seg[R]!=-1){seg[R+R]=seg[R];seg[R+R+1]=seg[R];}
				seg[L]=-1;seg[R]=-1;
				L*=2;R*=2;
				if(mae&(1<<h)){L++;}
				if(sta&(1<<h)){R++;}
				if(L%2==0){seg[L+1]=i;}
				if(R%2==1){seg[R-1]=i;}
			}
		}
		//上書き完了
	}
	//for(i=0;i<n;i++){cerr<<dp[i]<<endl;}
	for(i=1;i<131072;i++){if(seg[i]<0){continue;}seg[i+i]=seg[i];seg[i+i+1]=seg[i];}
	llint ans=big;
	for(i=0;i<=n;i++){
		if(i>0&&atu[i-1]==atu[i]){continue;}
		int ter=seg[i+131072];
		if(ter==-1){ans=0;break;}
		mineq(ans,dp[ter]+(Kbig+wa[ter+1]-atu[i])%K);
		//cerr<<"i="<<i<<"t="<<ter<<"wa="<<wa[ter+1]<<"atu="<<atu[i]<<endl;
	}
	ans+=wa[n];
	cout<<ans<<endl;
	return 0;
}
```