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

typedef long long ll;
const ll mod = 1e9 + 7;
const int N = 5e5 + 10;
ll a[N], b[N];
int n, m, t, p;

int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> t >> p;
		if (t == 1) {
			a[p]++;
		} else {
			b[p]++;
		}
	}
	for (int i = 1; i <= n; i++) {
		a[i] += a[i - 1];
		b[i] += b[i - 1];
	}
	for (int i = 1; i <= n; i++) {
		b[i] += b[i - 1];
		cout << (a[i] + b[i]) % mod << " ";
	}
	return 0;
}

#include <bits/stdc++.h> using namespace std; int main(){ int n,m; cin>>n>>m; long long x[500000],y[500000],e=1e9+7; while(m--){ int a,b; cin>>a>>b; if(a==1){ x[b]++; }else{ y[b]++; } } for(int i=1;i<=n;i++){ x[i]+=x[i-1]; y[i]+=y[i-1]; } for(int i=1;i<=n;i++){ y[i]+=y[i-1]; cout<<(x[i]+y[i])%e<<" "; } return 0; }