#include <iostream>
//#include <fstream>
#include <vector>
#include <algorithm>

#define ll long long

using namespace std;

//ifstream cin("aruszallitas.in");
//ofstream cout("aruszallitas.out");

vector<pair<ll,ll> >x;

ll aa,bb,db,i,n,m,a,b;
ll has(pair<ll,ll> a, pair<ll,ll> b)
{
    if (a.first>b.first) return 0;
    else return 1;
}
ll leker(ll a,ll b,ll c,ll d)
{
    if(c<=b)
    {
        aa=min(a,c);
        bb=max(b,d);
    }
    else
    {
        db+=c-b;
        aa=-1;
        bb=-1;
    }
}
int main()
{
    cin>>n>>m;
    x.resize(m+1);
    for(i=1;i<=m;++i)
    {
        cin>>a>>b;
        x[i]={a,b};
    }
    //x.push_back({n,n});

    sort(x.begin()+1,x.end(),has);

    aa=x[1].first;
    bb=x[1].second;
    db+=x[1].first-1;
    for(i=2;i<=m;++i)
    {
        leker(aa,bb,x[i].first,x[i].second);
        if(aa==-1 && bb==-1)
        {
            aa=x[i].first;
            bb=x[i].second;

        }
    }
    db+=(n-x[m].second);
    cout<<db;

    return 0;
}