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;
struct unit {
  int t, k, d;
  int id;
  int ans;
} task[100010];
int server[111];
int n, q;
void init() { memset(server, 0, sizeof(server)); }
int cmp1(unit a, unit b) { return a.t < b.t; }
int cmp2(unit a, unit b) { return a.id < b.id; }
int main() {
  ios::sync_with_stdio(false);
  while (cin >> n >> q) {
    init();
    for (int i = 1; i <= q; i++)
      task[i].id = i, cin >> task[i].t >> task[i].k >> task[i].d;
    sort(task, task + q, cmp1);
    int x = 1;
    for (int i = 1; i <= 1010000; i++) {
      for (int j = 1; j <= n; j++)
        if (server[j]) server[j]--;
      if (x > q) continue;
      if (task[x].t != i) continue;
      int rest = 0;
      for (int j = 1; j <= n; j++)
        if (!server[j]) rest++;
      if (rest < task[x].k) {
        task[x].ans = -1;
      } else {
        task[x].ans = 0;
        for (int j = 1; j <= n; j++)
          if (!server[j] && task[x].k) {
            task[x].ans += j;
            server[j] = task[x].d;
            task[x].k--;
          }
      }
      x++;
    }
    sort(task, task + q, cmp2);
    for (int i = 1; i <= q; i++) cout << task[i].ans << endl;
  };
  return 0;
}
