#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>

int n;
long long a[20], r[20];
int bomb[20];

std::set<int> set;

int main() {
    freopen("bombmine.in", "r", stdin);
    freopen("bombmine.out", "w", stdout);
    int c;scanf("%d", &c);
    scanf("%d", &n);
    
    if (n >= 17) {
        printf("Ciallo~");
        return 0;
    }
    
    for (int i = 1; i <= n; ++i) {
        scanf("%lld %lld", &a[i], &r[i]);
    }
    
    for (int mask = 0; mask < (1 << n); ++mask) {
        std::queue<int> queue;
        for (int i = 1; i <= n; ++i) {
            bomb[i] = (mask >> (i - 1)) & 1;
            if (bomb[i]) queue.push(i);
        }
        while (!queue.empty()) {
            int now = queue.front();
            queue.pop();
            for (int i = 1; i <= n; ++i) {
                if (a[now] - r[now] <= a[i] && a[i] <= a[now] + r[now] && !bomb[i]) {
                    bomb[i] = 1;
                    queue.push(i);
                }
            }
        }
        int cover = 0;
        for (int i = 1; i <= n; ++i) {
            cover = (cover << 1) | bomb[i];
        }
        
        set.insert(cover);
    }
    
    printf("%llu\n", set.size());
    return 0;
}