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;
class type {
 public:
  long long int st, ser, dur;
  type() { st = ser = dur = 0; }
};
type rrr[100005];
class server {
 public:
  bool busy;
  long long int lgb;
  server() { busy = lgb = 0; }
};
server obost[100005];
vector<int> pro;
int main() {
  bool key;
  int i, j, k, m, n, res, cnt;
  scanf("%d %d", &n, &k);
  for (i = 1; i <= k; i++)
    scanf("%d %d %d", &rrr[i].st, &rrr[i].ser, &rrr[i].dur);
  for (i = 1; i <= rrr[1].ser; i++) {
    obost[i].busy = true;
    obost[i].lgb = rrr[1].dur;
  }
  long long int sto = rrr[1].ser * (rrr[1].ser + 1);
  printf("\n");
  printf("%d\n", sto / 2);
  for (i = 2; i <= k; i++) {
    cnt = res = 0;
    for (j = 1; j <= n; j++) {
      if (obost[j].lgb < rrr[i].st) {
        cnt++;
        obost[j].lgb = rrr[i].st + rrr[i].dur - 1;
        pro.push_back(j);
        if (cnt == rrr[i].ser) break;
      }
    }
    if (cnt == rrr[i].ser) {
      int run = pro.size();
      for (j = 0; j < run; j++) res += pro[j];
      printf("%d\n", res);
    } else
      printf("%d\n", -1);
    pro.clear();
  }
  return 0;
}
