D1.Toy Train

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const int MAXN = 200 + 10;

vector<int> station[MAXN];
int train[MAXN];

int main()
{
    int n, m;
    int s, c;
    scanf("%d%d", &n, &m);
    for (int i = 1;i <= m;i++)
    {
        scanf("%d%d", &s, &c);
        int cost;
        if (s <= c)
            cost = c - s;
        else
            cost = n - (s - c);
        station[s].push_back(cost);
    }
    for (int i = 1;i <= n;i++)
        sort(station[i].begin(), station[i].end());
    for (int i = 1;i <= n;i++)
    {
        int res = -1;
        for (int j = 1;j <= n;j++)
        {
            if (!station[j].size())
                continue;
            int cost;
            if (i <= j)
                cost = j - i;
            else
                cost = n - (i - j);
            int k = station[j].size() - 1;
            cost += k * n;
            cost += station[j][0];
            res = max(res, cost);
        }
        printf("%d ", res);
    }


    return 0;
}