#include<bits/stdc++.h>
using namespace std;
long long c,n,a[300005],r[300005],as,vs[300005];
vector<int>v[300005];
map<long long,int>mp;
const int M=1e9+7;
queue<int>q;
int main(){
    freopen("bombmine.in","r",stdin);
    freopen("bombmine.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>c>>n;
    for(int i=1;i<=n;i++) cin>>a[i]>>r[i];
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(a[i]+r[i]>=a[j]) v[i].push_back(j);
            else break;
        }
        for(int j=i-1;j>=1;j--){
            if(a[i]-r[i]<=a[j]) v[i].push_back(j);
            else break;
        } 
    }
    for(int i=0;i<(1<<n);i++){
        int pi=i;
        while(!q.empty()) q.pop();
        for(int j=1;j<=n;j++){
            if((i>>(j-1))&1) q.push(j),vs[j]=1;
            else vs[j]=0;
        }
        while(!q.empty()){
            int tp=q.front();
            q.pop();
            for(int j=0;j<v[tp].size();j++){
                if(!vs[v[tp][j]]){
                    q.push(v[tp][j]);
                    vs[v[tp][j]]=1;
                    pi|=(1<<(v[tp][j]-1));
                }
            }
        }
        if(!mp[pi]) as++,mp[pi]=1;
    }
    cout<<as;
    return 0;
}