#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;

namespace atcoder {

template <class S, 
          S (*op)(S, S), 
          S (*e)(), 
          class F, 
          S (*mapping)(F, S), 
          F (*composition)(F, F), 
          F (*id)()>
struct lazy_segtree {
  public:
    lazy_segtree() : lazy_segtree(0) {}
    explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        size = (int)bit_ceil(_n);
        log = countr_zero(size);
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }

        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    template <bool (*g)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return g(x); });
    }
    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= _n);
        assert(g(e()));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (g(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*g)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return g(x); });
    }
    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= _n);
        assert(g(e()));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        
        return 0;
    }


    template <class H, bool (*h)(S&, H&)>
    void query(int l, int r, H &res, bool upd=true) {
        assert(0 <= l && l<=r && r<= _n);
        if (l==r) return ;

        l += size;
        r += size;

        if(upd){
            for (int i = log; i >= 1; i--) {
                if (((l >> i) << i) != l) push(l >> i);
                if (((r >> i) << i) != r) push((r - 1) >> i);
            }
        }

        while (l < r) {
            if (l & 1) _query<H,h>(l++, res, upd);
            if (r & 1) _query<H,h>(--r, res, upd);
            l >>= 1;
            r >>= 1;
        }

        return;
    }
    template <class H, bool (*h)(S&, H&)>
    void _query(int k, H &res, bool upd) {
        if(h(d[k], res)){
            rep(i,2) _query<H,h>(k*2+i, res, upd);
        }
        if(upd && k<_n)update(k);
        return ;
    }

    template <bool (*h)(S, F)>
    void apply2(int l, int r, F f){
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply2<h>(l++, f);
                if (r & 1) all_apply2<h>(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }
    template <bool (*h)(S, F)>
    void all_apply2(int k, F f) {
        if(h(d[k], f)){
            push(k);
            rep(i,2) all_apply2<h>(k*2+i, f);
            update(k);
            return ;
        }
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
        return ;
    }


  private:
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }

    static int bit_ceil(int x) {
        return 1 << (32 - __builtin_clz(x - 1));
    }

    static int countr_zero(int x) {
        return __builtin_ctz(x);
    }
};

}

using namespace atcoder;


struct S{
    ll ma,l,r,sz;
};
S op(S a, S b){
    S s;
    s.sz=a.sz+b.sz;
    s.l=a.l;
    if(a.l==a.sz)s.l+=b.l;
    s.r=b.r;
    if(b.r==b.sz)s.r+=a.r;
    s.ma=max({a.ma,b.ma,s.l,s.r,a.r+b.l});
    return s;
}
S e(){
    return S{0,0,0,0};
}
using F = ll;
S mapping(F f, S s){
    if(f==1){
        s.l=s.sz;
        s.r=s.sz;
        s.ma=s.sz;
    }
    return s;
}
F composition(F f, F g){
    return f|g;
}
F id(){
    return 0;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll D,Q;
    cin>>D>>Q;
    vector<array<ll,2>> qu(Q);
    map<ll,ll> zap;
    rep(qi,Q){
        ll a,b;
        cin>>a>>b;
        b++;
        qu[qi] = {a,b};
        zap[a]=zap[b]=0;
    }
    {
        int i = 0;
        for(auto& [f,s]:zap) s=i++;
    }

    int N=(int)zap.size()-1;
    lazy_segtree<S,op,e,F,mapping,composition,id> seg(N);
    {
        auto it = zap.begin();
        rep(i,N) {
            auto nx = next(it);
            seg.set(i, S{0,0,0,nx->first-it->first});
            it=nx;
        }
    }

    rep(qi,Q){
        auto [a,b] = qu[qi];
        int l = zap[a];
        int r = zap[b];
        seg.apply(l,r,1);
        S res = seg.all_prod();
        cout<<res.ma<<endl;
    }
}