func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( -O3 )   using namespace std;   template <typename T1, typename T2>   ostream& operator<<(ostream& os, pair<T1, T2> p) {     cout <<  (  << p.first <<  ,   << p.second <<  ) ;     return os;   }   template <typename T>   ostream& operator<<(ostream& os, vector<T>& vec) {     os <<  { ;     for (int i = 0; i < vec.size(); i++)       os << vec[i] << (i + 1 == vec.size() ?    :  ,  );     os <<  } ;     return os;   }   template <typename T>   ostream& operator<<(ostream& os, set<T>& st) {     cout <<  { ;     for (auto itr = st.begin(); itr != st.end(); itr++)       cout << *itr << (next(itr) != st.end() ?  ,   :   );     cout <<  } ;     return os;   }   template <typename T1, typename T2>   ostream& operator<<(ostream& os, map<T1, T2> mp) {     cout <<  { ;     for (auto itr = mp.begin(); itr != mp.end(); itr++)       cout <<  (  << (itr->first) <<  ,   << (itr->second) <<  )             << (next(itr) != mp.end() ?  ,  :   );     cout <<  } ;     return os;   }   void dump_func() { cout << endl; }   template <class Head, class... Tail>   void dump_func(Head&& head, Tail&&... tail) {     cout << head;     if (sizeof...(Tail) == 0) {       cout <<    ;     } else {       cout <<  ,  ;     }     dump_func(std::move(tail)...);   }   template <class T>   inline bool chmax(T& a, T const& b) {     if (a >= b) return false;     a = b;     return true;   }   template <class T>   inline bool chmin(T& a, T const& b) {     if (a <= b) return false;     a = b;     return true;   }   void _main();   int main() {     cin.tie(0);     ios::sync_with_stdio(false);     _main();     return 0;   }   using ll = long long;   using P = pair<int, int>;   using Pl = pair<ll, ll>;   using vi = vector<int>;   using vvi = vector<vi>;   using vl = vector<ll>;   using vvl = vector<vl>;   const int mod = 1e9 + 7, INF = 1 << 29;   const double EPS = 1e-5, PI = 3.1415926535897932384626;   const ll lmod = 1e9 + 7, LINF = 1LL << 59;   template <int MOD>   struct ModInt {     static const int Mod = MOD;     unsigned x;     ModInt() : x(0) {}     ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }     ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }     int get() const { return (int)x; }     ModInt& operator+=(ModInt that) {       if ((x += that.x) >= MOD) x -= MOD;       return *this;     }     ModInt& operator-=(ModInt that) {       if ((x += MOD - that.x) >= MOD) x -= MOD;       return *this;     }     ModInt& operator*=(ModInt that) {       x = (unsigned long long)x * that.x % MOD;       return *this;     }     ModInt& operator/=(ModInt that) { return *this *= that.inverse(); }     ModInt operator+(ModInt that) const { return ModInt(*this) += that; }     ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }     ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }     ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }     ModInt inverse() const {       long long a = x, b = MOD, u = 1, v = 0;       while (b) {         long long t = a / b;         a -= t * b;         std::swap(a, b);         u -= t * v;         std::swap(u, v);       }       return ModInt(u);     }     bool operator==(ModInt that) const { return x == that.x; }     bool operator!=(ModInt that) const { return x != that.x; }     ModInt operator-() const {       ModInt t;       t.x = x == 0 ? 0 : Mod - x;       return t;     }   };   template <int MOD>   ostream& operator<<(ostream& st, const ModInt<MOD> a) {     st << a.get();     return st;   };   template <int MOD>   ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {     ModInt<MOD> r = 1;     while (k) {       if (k & 1) r *= a;       a *= a;       k >>= 1;     }     return r;   }   template <typename T, int FAC_MAX>   struct Comb {     vector<T> fac, ifac;     Comb() {       fac.resize(FAC_MAX, 1);       ifac.resize(FAC_MAX, 1);       for (int i = 1; i < FAC_MAX; i++) fac[i] = fac[i - 1] * i;       ifac[FAC_MAX - 1] = T(1) / fac[FAC_MAX - 1];       for (int i = FAC_MAX - 2; i >= 1; i--) ifac[i] = ifac[i + 1] * T(i + 1);     }     T aPb(int a, int b) {       if (b < 0 || a < b) return T(0);       return fac[a] * ifac[a - b];     }     T aCb(int a, int b) {       if (b < 0 || a < b) return T(0);       return fac[a] * ifac[a - b] * ifac[b];     }     T nHk(int n, int k) {       if (n == 0 && k == 0) return T(1);       if (n <= 0 || k < 0) return 0;       return aCb(n + k - 1, k);     }   };   using mint = ModInt<998244353>;   using vm = vector<mint>;   void _main() {     int N;     cin >> N;     int M;     cin >> M;     vvl g(N);     for (int i = 0; i < M; i++) {       int a, b;       cin >> a >> b;       a--;       b--;       g[a].push_back(b);     }     vl dist(N, LINF);     for (int i = 0; i < N; i++) {       for (auto u : g[i]) chmin(dist[i], (u - i + N) % N);       if (g[i].size() != 0) dist[i] += ll(g[i].size() - 1) * ll(N);       if (dist[i] == LINF) dist[i] = 0;     }     for (int i = 0; i < N; i++) {       ll ans = 0;       for (int j = 0; j < N; j++)         if (g[j].size() != 0) chmax(ans, dist[j] + ll((j - i + N) % N));       cout << ans << (i == N - 1 ?   n  :    );     }   }   