/*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
using pii = pair<int, int>;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
//const ll mod = 998244353;


inline void normal(ll &a) { a %= mod; (a < 0) && (a += mod); }
inline ll modMul(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); return (a * b) % mod; }
inline ll modAdd(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); return (a + b) % mod; }
inline ll modSub(ll a, ll b) { a %= mod, b %= mod; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, mod - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }

#define si(x) scanf("%d",&x)
#define sii(x,y) scanf("%d %d",&x,&y)
#define siii(x,y,z) scanf("%d %d %d",&x,&y,&z)
#define sl(x) scanf("%lld",&x)
#define sll(x,y) scanf("%lld %lld",&x,&y)
#define slll(x,y,z) scanf("%lld %lld %lld",&x,&y,&z)
#define ss(ch) scanf("%s",ch)
#define pi(x) printf("%d",x)
#define pii(x,y) printf("%d %d",x,y)
#define piii(x,y,z) printf("%d %d %d",x,y,z)
#define pl(x) printf("%lld",x)
#define pll(x,y) printf("%lld %lld",x,y)
#define plll(x,y,z) printf("%lld %lld %lld",x,y,z)
#define ps(ch) printf("%s",ch)
#define F(i,a,b)      for(int i= a; i <= b; i++)
#define R(i,b,a)      for(int i= b; i >= a; i--)
#define REP(i,n) for(int i = 0; i < (n); i++)

int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
/* for Random Number generate
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
*/
//**
template < typename F, typename S >ostream& operator << ( ostream& os, const pair< F, S > & p ) {return os << "(" << p.first << ", " << p.second << ")";}
template < typename T >ostream &operator << ( ostream & os, const vector< T > &v ) {os << "{"; for (auto it = v.begin(); it != v.end(); ++it) {if ( it != v.begin() ) os << ", "; os << *it;} return os << "}";}
template < typename T >ostream &operator << ( ostream & os, const set< T > &v ) {os << "["; for (auto it = v.begin(); it != v.end(); ++it) {if ( it != v.begin()) os << ", "; os << *it;} return os << "]";}
template < typename F, typename S >ostream &operator << ( ostream & os, const map< F, S > &v ) {os << "["; for (auto it = v.begin(); it != v.end(); ++it) {if ( it != v.begin() ) os << ", "; os << it -> first << " = " << it -> second ;} return os << "]";}
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
clock_t tStart = clock();
#define timeStamp dbg("Execution Time: ", (double)(clock() - tStart)/CLOCKS_PER_SEC)
void faltu () { cerr << endl; }
template <typename T>void faltu( T a[], int n ) {for (int i = 0; i < n; ++i) cerr << a[i] << ' '; cerr << endl;}
template <typename T, typename ... hello>
void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); }

// Program showing a policy-based data structure.
#include <ext/pb_ds/assoc_container.hpp> // Common file 
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less 
using namespace __gnu_pbds;

// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
        tree_order_statistics_node_update>
        new_data_set;
// find_by_order(k) – ফাংশনটি kth ordered element এর একটা পয়েন্টার রিটার্ন করে। অর্থাৎ তুমি চাইলেই kth ইন্ডেক্সে কি আছে, সেটা জেনে ফেলতে পারছো!
// order_of_key(x) – ফাংশনটি x এলিমেন্টটা কোন পজিশনে আছে সেটা বলে দেয়।
//*//**___________________________________________________**/
const int N = 300006;
ll t[N << 2], lazy[N << 2], up[N << 2];


void pushDown(ll v, ll l, ll r) {
	ll mid = (l + r) >> 1;
	if (up[v]) {
		t[v] = up[v];
		lazy[v * 2] = lazy[v * 2 + 1] = 0;
		up[v * 2] = up[v];
		up[2 * v + 1] = up[v] + (mid - l + 1);
		up[v] = 0;
	}
	if (lazy[v]) {
		t[v] +=lazy[v];
		lazy[v * 2] += lazy[v];
		lazy[v * 2 + 1] += lazy[v];
		lazy[v] = 0;
	}
}
void update(ll v, ll l, ll r, ll L, ll R) {
	pushDown(v, l, r);
	if (l > R || r < L)return;
	if (l >= L && r <= R) {
		lazy[v]++;
		pushDown(v, l, r);
		return;
	}
	ll mid = (l + r) >> 1;
	update(v * 2, l, mid, L, R);
	update(v * 2 | 1, mid + 1, r, L, R);
	t[v] = min(t[v * 2], t[v * 2 | 1]);
}

void modify(ll v, ll l, ll r, ll L, ll R, ll x) {
	pushDown(v, l, r);
	if (l > R || r < L)return;
	if (l >= L && r <= R) {
		lazy[v] = 0;
		up[v] = x + (l - L);
		pushDown(v, l, r);
		return;
	}
	ll mid = (l + r) >> 1;
	modify(v * 2, l, mid, L, R, x);
	modify(v * 2 | 1, mid + 1, r, L, R, x);
	t[v] = min(t[v * 2], t[v * 2 | 1]);
}

ll Query(ll v, ll l, ll r, ll L, ll R) {
	pushDown(v, l, r);
	if (l > R || r < L)return INT_MAX;
	if (l >= L && r <= R)return t[v];
	ll mid = (l + r) >> 1;
	ll z = min(Query(v * 2, l, mid, L, R), Query(v * 2 + 1, mid + 1, r, L, R));
	t[v] = min(t[v * 2], t[v * 2 + 1]);
	return z;
}
int32_t main()
{
	FASTIO
	///*
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	freopen("error.txt", "w", stderr);
#endif
//*/
	ll n, m;
	cin >> n >> m;
	for (ll i = 1; i <= n; i++) {
		ll l, r;
		cin >> l >> r;
		if (l > 1)update(1, 1, m, 1, l - 1);
		if (r < m)update(1, 1, m, r + 1, m);
		ll x = INT_MAX;
		if (l > 1)x = min(x, Query(1, 1, m, l - 1, l - 1) + 1);
		modify(1, 1, m, l, r, x);
		ll ans = t[1];
		if (ans > n + m)ans = -1;
		cout << ans << "\n";
	}
	return 0;
}

Measured memory_bytes: 24076