#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	int sz = (w + w + h - 1)*h / 2;
	vector<vector<int>>to(sz);
	int s = w * 2;
	int t = s + 1;
	mcf_graph<int, long long>g(t + 1);
	rep(i, w) {
		int x, y; cin >> x >> y;
		x--, y--;
		int l = y - x;
		int r = y;
		rep(j, w) {
			int c = 0;
			if (l <= j && j <= r) c = x;
			else c = x + abs(y - j);
			g.add_edge(i, w + j, 1, c);
		}
	}
	rep(i, w) {
		g.add_edge(s, i, 1, 0);
		g.add_edge(i + w, t, 1, 0);
	}
	auto result = g.flow(s, t, w);
	cout << result.second << endl;
	return 0;
}