You are an expert competitive programmer. You will be given a problem statement, test case constraints and example test inputs and outputs. Please reason step by step about the solution (that must respect memory and time limits), then provide a complete implementation in c++17.

Your solution must read input from standard input (cin), write output to standard output (cout).
Do not include any debug prints or additional output.

Put your final solution within a single code block:
```cpp
<your code here>
```

Execution time limit: 2.0 seconds
Memory limit: 512.0 MB

# Problem
William owns a flat in central London. He decided to rent his flat out for the next $$$n$$$ days to earn some money.

Since his flat is in the center of the city, he instantly got $$$m$$$ offers in the form $$$(l_i, r_i)$$$, which means that someone wants to book the flat from day $$$l_i$$$ until day $$$r_i$$$ inclusive. To avoid spending a lot of time figuring out whether it's profitable for him to accept an offer, William decided to develop an algorithm. The algorithm processes all offers as they arrive and will only accept offer $$$i$$$ if the following two conditions are satisfied:

- $$$r_i - l_i + 1 \ge x$$$.
- None of the days between $$$l_i$$$ and $$$r_i$$$ are occupied by a previously accepted offer

William isn't sure what value $$$x$$$ should have and he asks you for help. For all $$$x$$$ from $$$1$$$ to $$$n$$$ he wants you to calculate the total number of days for which the flat would be occupied if the corresponding value will be assigned to $$$x$$$.

## Input Format
The first line contains two integers $$$n$$$ and $$$m$$$ $$$(1 \le n \le 5 \cdot 10^4, 1 \le m \le 10^5)$$$, which are the number of days and the number of offers, respectively.

Each of the next $$$m$$$ lines contains two integers $$$l_i$$$ and $$$r_i$$$ $$$(1 \le l_i \le r_i \le n)$$$, which describe the $$$i$$$-th renting offer. All offers are given in chronological order.

## Output Format
Print $$$n$$$ integers. The number in $$$i$$$-th line must be equal to the number of days the flat would be occupied if the algorithm will use the value of $$$x$$$ equal to $$$i$$$.

## Examples
```input
6 5
2 3
3 5
1 1
1 5
1 6
```
```output
3
2
3
5
5
6
```

## Note
The description of segments from the first sample test for each $$$x$$$:

- $$$x = 1$$$  — algorithm will approve offers: $$$1$$$ (2..3), $$$3$$$ (1..1). The total number of days for which William's flat will be rented out is 3
- $$$x = 2$$$  — algorithm will approve offers: $$$1$$$ (2..3). The total number of days for which William's flat will be rented out is 2
- $$$x = 3$$$  — algorithm will approve offers: $$$2$$$ (3..5). The total number of days for which William's flat will be rented out is 3
- $$$x = 4$$$  — algorithm will approve offers: $$$4$$$ (1..5). The total number of days for which William's flat will be rented out is 5
- $$$x = 5$$$  — algorithm will approve offers: $$$4$$$ (1..5). The total number of days for which William's flat will be rented out is 5
- $$$x = 6$$$  — algorithm will approve offers: $$$5$$$ (1..6). The total number of days for which William's flat will be rented out is 6

Now solve the problem and return the code.