#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class M>
struct LazySegmentTree{
    using T = typename M::T;
    using L = typename M::L;
    int sz, n, height{};
    vector<T> seg; vector<L> lazy;
    explicit LazySegmentTree(int n) : n(n) {
        sz = 1; while(sz < n) sz <<= 1, height++;
        seg.assign(2*sz, M::e());
        lazy.assign(2*sz, M::l());
    }

    void set(int k, const T &x){ seg[k + sz] = x; }

    void build(){
        for (int i = sz-1; i > 0; --i) seg[i] = M::f(seg[i<<1], seg[(i<<1)|1]);
    }

    T reflect(int k){ return lazy[k] == M::l() ? seg[k] : M::g(seg[k], lazy[k]); }

    void eval(int k){
        if(lazy[k] == M::l()) return;
        if(k < sz){
            lazy[(k<<1)|0] = M::h(lazy[(k<<1)|0], lazy[k]);
            lazy[(k<<1)|1] = M::h(lazy[(k<<1)|1], lazy[k]);
        }
        seg[k] = reflect(k);
        lazy[k] = M::l();
    }
    void thrust(int k){ for (int i = height; i; --i) eval(k>>i); }
    void recalc(int k) { while(k >>= 1) seg[k] = M::f(reflect((k<<1)|0), reflect((k<<1)|1));}

    void update(int a, const T &x){
        thrust(a += sz);
        seg[a] = x;
        recalc(a);
    }

    void update(int a, int b, const L &x){
        thrust(a += sz); thrust(b += sz-1);
        for (int l = a, r = b+1;l < r; l >>=1, r >>= 1) {
            if(l&1) lazy[l] = M::h(lazy[l], x), l++;
            if(r&1) --r, lazy[r] = M::h(lazy[r], x);
        }
        recalc(a);
        recalc(b);
    }

    T query(int a, int b){ // [l, r)
        thrust(a += sz);
        thrust(b += sz-1);
        T ll = M::e(), rr = M::e();
        for(int l = a, r = b+1; l < r; l >>=1, r>>=1) {
            if (l & 1) ll = M::f(ll, reflect(l++));
            if (r & 1) rr = M::f(reflect(--r), rr);
        }
        return M::f(ll, rr);
    }

    template<class F>
    int search_right(int l, F cond){
        if(l == n) return n;
        thrust(l += sz);
        T val = M::e();
        do {
            while(!(l&1)) l >>= 1;
            if(!cond(M::f(val, seg[l]))){
                while(l < sz) {
                    eval(l);
                    l <<= 1;
                    if (cond(M::f(val, seg[l]))){
                        val = M::f(val, seg[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            val = M::f(val, seg[l]);
            l++;
        } while((l & -l) != l);
        return n;
    }

    template<class F>
    int search_left(int r, F cond){
        if(r <= 0) return 0;
        thrust((r += sz)-1);
        T val = M::e();
        do {
            r--;
            while(r > 1 && r&1) r >>= 1;
            if(!cond(M::f(seg[r], val))){
                while(r < sz) {
                    eval(r);
                    r = ((r << 1)|1);
                    if (cond(M::f(seg[r], val))){
                        val = M::f(seg[r], val);
                        r--;
                    }
                }
                return r + 1 - sz;
            }
            val = M::f(seg[r], val);
        } while((r & -r) != r);
        return 0;
    }
};

struct Monoid{
    using T = array<int, 4>; // start, length, min(ai-i), min(ai)
    using L = int;
    static T f(T a, T b) {
        return {min(a[0], b[0]), a[1]+b[1], min(a[2], b[2]), min(a[3], b[3])};
    }
    static T g(T a, L b) {
        if(b < 0) return a;
        if(b == INF<int>) return {a[0], a[1], INF<int>, INF<int>};
        return {a[0], a[1], (a[1] ? b-a[0]-a[1]+1 : INF<int>), (a[1] ? b : INF<int>)};
    }
    static L h(L a, L b) {
        if(b < 0) return a;
        return b;
    }
    static T e() { return {INF<int>, 0, INF<int>, INF<int>}; }
    static L l() { return -1; }
};

int main() {
    int h, w;
    cin >> h >> w;
    LazySegmentTree<Monoid> seg(w);
    for (int i = 0; i < w; ++i) {
        seg.set(i, {i, 1, 0, i});
    }
    auto search = [&](int x){
        int ok = w, ng = -1;
        while(ok-ng > 1){
            int mid = (ok+ng)/2;
            if(seg.query(mid, w)[3] >= x) ok = mid;
            else ng = mid;
        }
        return ok;
    };
    seg.build();
    for (int i = 0; i < h; ++i) {
        int a, b;
        scanf("%d %d", &a, &b);
        a--;
        int r = search(b);
        int l = search(a);
        seg.update(l, r, (b == w ? INF<int> : b));
        int ans = seg.query(0, w)[2];
        cout << (ans == INF<int> ? -1 : ans+i+1) << "\n";
    }
    return 0;
}

Measured memory_bytes: 13536