#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<ctime>

#include<queue>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

struct node {

    int x,y;

};

node d[];

int px[],py[],pa[],pb[],tot[],ans[];

inline bool cmp(const node a,const node b){

    return a.x==b.x?a.y<b.y:a.x<b.x;

}

int main(){

    int n,m,i,j,k;

    scanf("%d%d",&n,&m);

    for(i=;i<=m;i++)scanf("%d%d",&d[i].x,&d[i].y);

    sort(d+,d+m+,cmp);

    for(i=;i<=m;i++){

      int x=d[i].x,y=d[i].y;

      if(px[x])tot[i]++,tot[px[x]]++;

      if(py[y])tot[i]++,tot[py[y]]++;

      if(pa[x+y])tot[i]++,tot[pa[x+y]]++;

      if(pb[x-y+n])tot[i]++,tot[pb[x-y+n]]++;

      px[x]=i,py[y]=i,pa[x+y]=i,pb[x-y+n]=i;

    }

    for(i=;i<=m;i++)ans[tot[i]]++;

    for(i=;i<;i++)printf("%d ",ans[i]);

    return ;

}