#include<bits/stdc++.h>
using namespace std;

#define int long long
const int N = 3 * 1e5 + 5;
int c, n;
int a[N], r[N];
unordered_map<unsigned long long, int> mp;
const int BASE = 133;
bool vis[N], dfn[N];

inline void dfs(int x){
    dfn[x] = 1;
    for(int i = 1;i <= n;i ++){
        if(a[x] - r[x] <= a[i] && a[i] <= a[x] + r[x] && !dfn[i]){
            dfs(i);
        }
    }
}

signed main(){
    freopen("bombmine.in", "r", stdin);
    freopen("bombmine.out", "w", stdout);
    cin >> c;
    cin >> n;
    for(int i = 1;i <= n;i ++){
        cin >> a[i] >> r[i];
    }
    for(int msk = 0;msk < (1 << n);msk ++){
        for(int i = 0;i < n;i ++){
            vis[i + 1] = (msk >> i) & 1;
            dfn[i + 1] = 0;
        }
        for(int i = 1;i <= n;i ++){
//            cout << vis[i] << ' ';
            if(vis[i] && !dfn[i]){
                dfs(i);
            }
        }
//        cout << '\n';
        unsigned long long hs = 0;
        for(int i = 1;i <= n;i ++){
//            cout << dfn[i] << ' ';
            hs = hs * BASE + dfn[i];
        }
//        cout << '\n';
        mp[hs] ++;
    }
    cout << mp.size() << '\n';
    return 0;
}