Codeforces#364（Div.2）B.Cell Not Under Attack

Vasya has the square chessboard of size n × n and m rooks. Initially the chessboard is empty. Vasya will consequently put the rooks on the board one after another.

The cell of the field is under rook's attack, if there is at least one rook located in the same row or in the same column with this cell. If there is a rook located in the cell, this cell is also under attack.

You are given the positions of the board where Vasya will put rooks. For each rook you have to determine the number of cells which are not under attackafter Vasya puts it on the board.

Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 100 000,1 ≤ m ≤ min(100 000, n2)) — the size of the board and the number of rooks.

Each of the next m lines contains integers xi and yi (1 ≤ xi, yi ≤ n) — the number of the row and the number of the column where Vasya will put the i-th rook. Vasya puts rooks on the board in the order they appear in the input. It is guaranteed that any cell will contain no more than one rook.

Output

Print m integer, the i-th of them should be equal to the number of cells that are not under attack after first i rooks are put.

Examples

input

3 3
1 1
3 1
2 2

output

4 2 0 

input

5 2
1 5
5 1

output

16 9 

input

100000 1
300 400

output

9999800001 

Note

On the picture below show the state of the board after put each of the three rooks. The cells which painted with grey color is not under the attack.

思路： 两个标记数组标记行列。大水题阿大水题还想那么久..

代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

bool vish[100000 + 5];
bool visl[100000 + 5];

int main()
{
    long long n,m;
    cin>>n>>m;
    long long sum = n*n;
    memset(vish,0,sizeof vish);
    memset(visl,0,sizeof visl);
    int nx = 0, ny = 0;
    for(int i = 0; i < m; i++)
    {
        int x,y;
        cin>>x>>y;
        if(!vish[x] && !visl[y])
        {
            sum = sum - (n-nx)-(n-ny) + 1;
            vish[x] = 1;
            visl[y] = 1;
            nx++;
            ny++;
        }
        else if(vish[x] && !visl[y])
        {
            sum -= (n-nx);
            visl[y] = 1;
            ny++;
        }
        else if(!vish[x] && visl[y])
        {
            sum -= (n-ny);
            vish[x] = 1;
            nx++;
        }
        if(i != m -1)
            cout<<sum<<" ";
        else
            cout<<sum<<endl;
    }
    return 0;
}