#include <bits/stdc++.h>

#define el '\n'

typedef long long ll;
typedef long double ld;

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    int n, m;
    cin >> n >> m;

    int u[m + 1], d[m + 1];
    for (int j = 1; j <= m; j++)
        cin >> u[j] >> d[j];

    ll dp[n + 1][m + 2];

    memset(dp, '?', sizeof dp);

    for (int i = 1; i <= n; i++)
        dp[i][1] = 0;

    multiset<ll> cur, rem[n + 1];
    for (int j = 1; j <= m; j++) {
        for (int i = 1; i + d[j] - u[j] <= n; i++) {
            cur.insert(dp[i][j] + abs(i - u[j]));
            rem[i + d[j] - u[j]].insert(dp[i][j] + abs(i - u[j]));

            dp[i][j + 1] = *cur.begin();

            while (rem[i].size())
                cur.erase(cur.find(*rem[i].begin())), rem[i].erase(rem[i].begin());
        }
    }

    ll mn = dp[1][m + 1];
    for (int i = 2; i <= n; i++)
        mn = min(mn, dp[i][m + 1]);

    cout << mn;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();

    return 0;
}