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;
const int INF = 2034567891;
const long long int INF64 = 1234567890123456789ll;
long long int gcd(long long int a, long long int b) {
  return (b == 0 ? a : gcd(b, a % b));
}
long long int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
long long int power(long long int x, long long int y) {
  long long int ans = 1;
  while (y > 0) {
    if (y & 1) ans = (ans * x) % 1000000007;
    x = (x * x) % 1000000007;
    y /= 2;
  }
  return ans;
}
long long int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
              dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
  long long int n, q, time, k, d, cur_time = 0;
  cin >> n >> q;
  long long int avail = 0;
  long long int used[n + 1];
  memset(used, 0, sizeof(used));
  while (q--) {
    avail = 0;
    cin >> time >> k >> d;
    for (long long int i = 1; i <= n; i++) {
      if (time > used[i]) avail++;
    }
    if (avail < k) {
      cout << "-1" << endl;
      continue;
    }
    long long int sum = 0;
    for (long long int i = 1; i <= n; i++) {
      if (time > used[i] && k > 0) {
        sum += i;
        used[i] = time + d - 1;
        k--;
      }
    }
    cout << sum << endl;
  }
}
