100 1
1000000 100 1000
 5 3
1 4 10
2 2 5
3 1 6
 10 4
1 5 20
2 5 200
100 6 20
101 1 100
 5 3
1 3 4
4 3 4
6 4 1
 4 1
6 1 1
 8 6
1 3 20
4 2 1
6 6 5
9 1 1
15 3 6
21 8 8
 4 5
1 2 3
2 1 3
3 1 2
4 3 3
5 4 1
 8 4
1 3 2
2 3 100
10 6 20
11 5 20
 4 10
1 1 1
3 1 2
4 1 2
6 1 2
8 1 2
13 1 2
16 1 1
17 1 2
19 3 1
20 1 1
 5 3
1 4 4
4 2 2
5 5 2
 4 3
1 3 10
2 2 15
12 4 1
 5 4
1 1 4
2 4 4
5 2 20
11 5 2
 1 10
4 1 1
9 1 1
10 1 1
12 1 1
13 1 1
15 1 1
16 1 1
18 1 1
19 1 1
20 1 1

5050
 10
-1
5
 15
40
-1
1
 6
-1
10
 1
 6
9
-1
4
15
36
 3
3
4
-1
10
 6
15
-1
21
 1
1
2
1
1
1
1
1
6
1
 10
-1
15
 6
-1
10
 1
14
-1
15
 1
1
1
1
1
1
1
1
1
1

#include <bits/stdc++.h>
using namespace std;
int _gcd(int a, int b) { return b == 0 ? a : _gcd(b, a % b); }
int phi(int n) {
  int ret = n;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        n /= i;
      }
      ret -= ret / i;
    }
  }
  if (n > 1) ret -= ret / n;
  return ret;
}
int a[] = {10, 20, 30, 40, 50, 60, 70, 80};
int binarysearch(int aa[], int key) {
  int begin = 0;
  int end = 7;
  int mid = 0;
  int index = -1;
  while (begin <= end) {
    mid = begin + end;
    mid /= 2;
    if (aa[mid] == key) {
      index = mid;
      break;
    } else if (aa[mid] < key)
      begin = mid + 1;
    else if (aa[mid] > key)
      end = mid - 1;
  }
  return index;
}
int x[] = {0, 1, 0, -1, -1, -1, 0, 1};
int y[] = {1, 1, 1, 1, 0, -1, -1, -1};
vector<int> v[30030];
map<int, int> m;
bool vis[30030];
bool prime(int n) {
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int main() {
  int n, q;
  while (cin >> n >> q) {
    int server[n], t, k, d, kk = 1;
    memset(server, 0, sizeof server);
    for (int i = 1; i <= q; i++) {
      cin >> t >> k >> d;
      int sum = 0;
      int currentavailable = 0;
      if (i == 1) {
        currentavailable = n;
        if (k > n)
          cout << "-1\n";
        else {
          kk = t;
          for (int j = 0; j < k; j++) {
            if (server[j] == 0) {
              server[j] = d;
              sum += j + 1;
            }
          }
          cout << sum << endl;
        }
      } else {
        for (int j = 0; j < n; j++) {
          int ss = server[j];
          if (server[j] > 0) {
            server[j] -= abs(t - kk);
            if (server[j] < 0) server[j] = 0;
          }
        }
        for (int i = 0; i < n; i++) {
          if (server[i] == 0) currentavailable++;
        }
        if (currentavailable >= k) {
          for (int j = 0, l = 0; j < n and l < k; j++) {
            if (server[j] == 0) {
              server[j] = d;
              sum += j + 1;
              l++;
            }
          }
          cout << sum << endl;
        } else
          cout << "-1\n";
        kk = t;
      }
    }
  }
  return 0;
}
