#include <bits/stdc++.

h>
using namespace std;
#define pii pair<int, int>

int main() {
int n, m;
cin >> n >> m;
vector<list<int> > v;
for (int i = 0; i < n; ++i) v[i] = *new list<int>();

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

int src, dest;
cin >> src >> dest;
v[src].push_back(dest);
}

for (int i = 0; i < n; ++i) {

sort(v[i].begin(), v[i].end());
}

for (int i = 0; i < n; ++i) {

int count = 0;
int ans = 0;
vector<int> pointers (n, 0);
while (count < m) {
for (int i = 0; i < n; ++i) {
if (pointer[i] < v[i].size()) {
ans += (v[poiter[i]] - i + n) % n;
++pointer[i];
++count;
}
}
}
cout << count << endl;
}

return 0;
}