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 fa {
  int a, b, c;
} vec[2 * 111111];
bool comp(fa a, fa b) { return a.a < b.a; }
int main() {
  int n, q;
  cin >> n >> q;
  int a, b, c;
  for (int i = 0; i < q; ++i) {
    scanf("%d %d %d", &a, &b, &c);
    vec[i].a = a;
    vec[i].b = b;
    vec[i].c = c;
    vec[i + q].a = a + c - 1;
    vec[i + q].b = -1;
    vec[i + q].c = -1;
  }
  sort(vec, vec + 2 * q, comp);
  int num = n;
  int arr[101];
  int mark[1111111];
  memset(mark, 0, sizeof mark);
  map<int, vector<int> > dias;
  int ans = 0;
  for (int i = 0; i < 101; ++i) arr[i] = 1;
  for (int i = 0; i < 2 * q; ++i) {
    if (vec[i].b == -1) {
      if (dias[vec[i].a].size() > 0 && !mark[vec[i].a]) {
        mark[vec[i].a] = 1;
        num += dias[vec[i].a].size();
        for (int j = 0; j < dias[vec[i].a].size(); ++j) {
          arr[dias[vec[i].a][j]] = 1;
        }
      }
    } else {
      if (num >= vec[i].b) {
        num -= vec[i].b;
        ans = 0;
        for (int j = 0; j < 100 && vec[i].b > 0; j++) {
          if (arr[j] == 1 && vec[i].b > 0) {
            vec[i].b--;
            arr[j] = 0;
            ans += j + 1;
            dias[vec[i].a + vec[i].c - 1].push_back(j);
          }
        }
        cout << ans << endl;
      } else {
        cout << -1 << endl;
      }
      if (dias[vec[i].a].size() > 0 && !mark[vec[i].a]) {
        mark[vec[i].a] = 1;
        num += dias[vec[i].a].size();
        for (int j = 0; j < dias[vec[i].a].size(); ++j) {
          arr[dias[vec[i].a][j]] = 1;
        }
      }
    }
  }
  return 0;
}
