#include <bits/stdc++.h>
using namespace std;
const int maxn = 1200;
int fa[maxn];

int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n+1; i++) fa[i] = i;
    for(int i = 1; i <= m; i++){
        int x, y;
        scanf("%d%d", &x, &y);
        fa[x] = max(fa[x], y);
    }
    long long ans = n+1;
    int l = 1, r = 1;
    for(int i = 1; i <= n; ){
        r = fa[i];
        int now = i;
        while(now <= r){
            r = max(r, fa[now]);
            now++;
        }
        ans += 2*(r-i);
        i = now;
    }
    printf("%lld\n", ans);
    return 0;
}