#include <bits/stdc++.h> #define LL long long using namespace std; const int MAXN=1e6+5; int N,M; int ans[5005]; int main() { /// freopen("moyun.in","r",stdin); // freopen("moyun.out","w",stdout); scanf("%d %d",&N,&M); for(int i=1;i<=M;i++) { int l,r; scanf("%d %d",&l,&r); for(int i=1;i<=N;i++) { int bl=(l+i-1)/i; int br=(r+i-1)/i; ans[i]+=max(0,br-bl-1); if(bl==br) { ans[i]+=r-l+1; continue; } int R=bl*i,L=(br-1)*i+1; ans[i]+=R-l+1+r-L+1; } } for(int i=1;i<=N;i++) printf("%d ",ans[i]); puts(""); return 0; }