#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

int main(){
    ll n,m; cin>>n>>m;

    map<ll , ll> mpr,mpc;

    rep(i,m){
        ll a,b; cin>>a>>b;
        a--; b--;

        ll x = a+b;
        ll y = a-b;

        mpr[x] = 0;
        mpc[y] = 0;
    }

    ll ans = 0;

    vl vr,vc;

    fore(y , mpc){
        vc.pb(y.fi);
        ans += n - abs(y.fi);
    }

    fore(y , mpr){
        vr.pb(y.fi);
        ans += n - abs(y.fi - n + 1);
    }

    sort(rng(vr));

    // cout << ans << endl;

    ll sum = 0;

    fore(y , mpc){
        ll sum2 = 0;
        ll lk = abs(y.fi);
        ll l = -lk + (ll)2 * n - 2;
        // deb(l , y.fi);
        ll k = vr.end() - upper_bound(rng(vr) , l);
        sum2 += k;
        l = lk;
        k = lower_bound(rng(vr) , l) - vr.begin();
        sum2 += k;

        if (lk == n-1) sum2--;

        sum += (sz(vr) - sum2);
        // deb(sum , y.fi);
    }

    // fore(y , mpr){
    //     ll l = n - 1 + y.fi;
    //     ll k = vr.end() - lower_bound(rng(vr) , l);
    //     sum += k;
    //     l = n - 1 - y.fi;
    //     k = upper_bound(rng(vr) , l) - vr.begin();
    //     sum += k;  
    // }

    ans -=  sum;

    out;

    return 0;
}