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;
void sc(int &x) {
  register int c = getchar();
  x = 0;
  int neg = 0;
  for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
    ;
  if (c == '-') {
    neg = 1;
    c = getchar();
  }
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
  if (neg) x = -x;
}
long long power(long long a, long long b, long long m) {
  long long res = 1;
  while (b > 0) {
    if (b % 2 != 0) res = (res * a) % m;
    a = (a * a) % m;
    b /= 2;
  }
  return res % m;
}
long long gcd(long long a, long long b) {
  return ((b == 0) ? a : gcd(b, a % b));
}
int main() {
  int n, q, i, j;
  int arr[102];
  memset(arr, 0, sizeof(arr));
  long long sum;
  int ans, rem;
  int t[100001], d[100001], k[100001];
  long long a[100001];
  sc(n), sc(q);
  for (i = 1; i < q + 1; i++) sc(t[i]), sc(k[i]), sc(d[i]);
  for (i = 1; i < q + 1; i++) {
    sum = 0;
    ans = 0;
    rem = 0;
    for (j = 1; j < n + 1; j++) {
      if (arr[j] != 0) {
        if (t[i] > arr[j])
          arr[j] = 0;
        else
          rem++;
      }
    }
    if (n - rem < k[i]) {
      a[i] = -1;
      continue;
    }
    for (j = 1; j < n + 1; j++) {
      if (arr[j] == 0) {
        ans++;
        sum += j;
        arr[j] = t[i] + d[i] - 1;
      }
      if (ans == k[i]) {
        a[i] = sum;
        break;
      }
    }
  }
  for (i = 1; i < q + 1; i++) cout << a[i] << endl;
  return 0;
}
