import sys

L , n = map(int,input().split())
tree = [1]*(L+1)
cnt = int(0)
for i in range(n):
    a, b = map(int,input().split())
    for j in range(a-1,b,1):
        tree[j] = 0
print(sum(tree))