#include <bits/stdc++.h>
using namespace ::std;
const long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a + b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long mul(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a * b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
  long long res = 1LL;
  a = a % m;
  while (b) {
    if (b & 1) res = mul(res, a, m);
    b >>= 1;
    a = mul(a, a, m);
  }
  return res;
}
long long fastexp(long long a, long long b) {
  long long res = 1LL;
  while (b) {
    if (b & 1) res = res * a;
    b >>= 1;
    a *= a;
  }
  return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtendido(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int modInverso(int a, int m) {
  int x, y;
  int g = gcdExtendido(a, m, &x, &y);
  if (g != 1)
    return -1;
  else
    return (x % m + m) % m;
}
const int N = 5000;
int n, m;
int ans[N];
int closest[N];
int out[N];
int getDis(int a, int b) {
  if (a <= b) return b - a;
  return b + n - a;
}
int getTime(int pos, int start) {
  if (out[pos] == 0) return 0;
  int ans = n * (out[pos] - 1) + closest[pos] + getDis(start, pos);
  return ans;
}
int main() {
  scanf("%d %d", &(n), &(m));
  int a, b;
  for (int i = 1; i <= n; i++) closest[i] = n + 2;
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &(a), &(b));
    out[a]++;
    closest[a] = min(closest[a], getDis(a, b));
  }
  for (int i = 1; i <= n; i++) {
    int act = 0;
    for (int j = 1; j <= n; j++) {
      act = max(act, getTime(j, i));
    }
    ans[i] = act;
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  puts("");
  return 0;
}
