#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
int main() {
  long long n, m;
  cin >> n >> m;
  vector<int> row(n), col(n);
  int r = 0, c = 0;
  int x, y;
  long long ans = n * n;
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &x, &y);
    long long v = 0;
    if (row[x - 1] == 0 && col[y - 1] == 0)
      v = n + n - (1 + r + c);
    else if (row[x - 1] && col[y - 1])
      v = 0;
    else if (row[x - 1])
      v = n - r;
    else if (col[y - 1])
      v = n - c;
    ans -= v;
    if (row[x - 1] == 0) row[x - 1] = 1, r++;
    if (col[y - 1] == 0) col[y - 1] = 1, c++;
    printf("%lld ", ans);
  }
  printf("\n");
}
