// clang-format off
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#ifndef ritick
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif

#define int long long
typedef long long ll;
typedef long double ld;
typedef long double f80;
typedef pair<int, int> pii;
typedef gp_hash_table<int, int> umap;
typedef tree<int, null_type, less<int>, rb_tree_tag,
        tree_order_statistics_node_update> oset;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;

#define INF 100000000000000000
#define MOD  1000000007
#define EPS 1e-7
#define PI 3.1415926535897932385
// #define PI acos(-1)

#define pb emplace_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (int)x.length()

#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar))  // 0x3f for inf, 0x80 for -INF can also use with pairs

#ifdef ritick
template<typename T>
void __p(T a) { cout << a << " "; }
template<typename T>
void __p(std::vector<T> a) { cout << "{ "; for (auto p : a) __p(p); cout << "}"; }
template<typename T, typename F>
void __p(pair<T, F> a) { cout << "{ "; __p(a.first); __p(a.second); cout << "}"; }
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) { __p(a1); __p(a...); }
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
    cout<<name<<" : ";__p(arg1);cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
    int bracket=0,i=0;
    for(; ;i++)
        if(names[i]==','&&bracket==0)
            break;
        else if(names[i]=='(')
            bracket++;
        else if(names[i]==')')
            bracket--;
    const char *comma=names+i;
    cout.write(names,comma-names)<<" : ";
    __p(arg1);
    cout<<"| ";
    __f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif

mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
#define rand(l, r) uniform_int_distribution<int>(l, r)(rng32)
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll modpow(ll b, ll e, ll mod=MOD) {
    ll ans=1; for(;e;b=b*b%mod,e/=2) if(e&1) ans=ans*b%mod; return ans; }

ld modp(ld b, ll e) {
    ld ans=1; for(;e;b=b*b,e/=2) if(e&1) ans=ans*b; return ans; }




ll st[8*100005];
ll lazy[8*100005];
void push(ll v,ll tl,ll tr)
{
    if(lazy[v])
    {
        st[2*v]=st[v];
        ll tm=(tl+tr)/2;
        st[2*v+1]=st[v]+(tm-tl+1)*lazy[v];
        // trace(st[2*v],tl);
        // trace(st[2*v+1],tm+1);
        lazy[2*v]=lazy[v];
        lazy[2*v+1]=lazy[v];
        lazy[v]=0;
    }
}
void update(ll v,ll tl,ll tr,ll l,ll r,ll val)
{
    if(l>r)
        return;
    if(tl==l&&tr==r)
    {
        st[v]=val;
        lazy[v]=1;
    // trace(v,tl,tr,l,r,val,st[v]);
        return;
    }
    push(v,tl,tr);
    ll tm=(tl+tr)/2;
    update(2*v,tl,tm,l,min(tm,r),val);
    ll f=max(0ll,(tm-l+1));
    update(2*v+1,tm+1,tr,max(l,tm+1),r,val+f);
    st[v]=min(st[2*v],st[2*v+1]);
    // trace(v,tl,tr,l,r,val,st[v]);
}
ll query(ll v,ll tl,ll tr,ll l,ll r)
{
    if(l>r)
    {
        return INF;
    }
    if(tl==l&&tr==r)
    {
        return st[v];
    }
    push(v,tl,tr);
    ll tm=(tl+tr)/2;
    return min(query(2*v,tl,tm,l,min(r,tm)),query(2*v+1,tm+1,tr,max(l,tm+1),r));
}
void solve()
{
    ll n,m;
    cin>>n>>m;
    ll ans=0;
    rep(i,n)
    {
        ans++;
        ll bt=INF;
        ll x,y;
        cin>>x>>y;
        x--,y--;
        if(x!=0)
        {
            bt=query(1,0,m-1,x-1,x-1);
        }
        update(1,0,m-1,x,y,bt+1);
        if(ans+st[1]<INF)
        cout<<ans+st[1]<<endl;
        else
        cout<<-1<<endl;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(15);   cout<<fixed;
    #ifdef ritick
        cin.exceptions(cin.failbit);
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int t=1;
    // cin>>t;
    fr(i,1,t)
    {   
        // cout<<"Case "<<i<<": "<<endl;
        solve();
    }
    end_routine();
}   

Measured memory_bytes: 11800