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 task {
  int t, k, d;
  task() {}
  task(int a, int b, int c) {
    t = a;
    k = b;
    d = c;
  }
};
int main() {
  int n, q;
  cin >> n >> q;
  vector<task> v(q);
  int a, b, c;
  for (int i = 0; i < q; ++i) {
    cin >> a >> b >> c;
    v[i] = task(a, b, c);
  }
  reverse(v.begin(), v.end());
  vector<int> servers(n, 0);
  for (int i = 1; i <= 1e6 + 3333; ++i) {
    if (v.size()) {
      task cur = v.back();
      a = cur.t;
      b = cur.k;
      c = cur.d;
      if (a == i) {
        int free = 0;
        for (int j = 0; j < servers.size(); ++j) {
          if (!servers[j]) free++;
        }
        int tot = b;
        int sum = 0;
        if (free >= b) {
          for (int j = 0; j < servers.size() && tot > 0; ++j) {
            if (servers[j] == 0) {
              servers[j] = c;
              sum += j + 1;
              tot--;
            }
          }
          cout << sum << '\n';
        } else {
          cout << -1 << '\n';
        }
        v.pop_back();
      }
    }
    for (int j = 0; j < servers.size(); ++j) {
      if (servers[j] > 0) servers[j]--;
    }
  }
  return 0;
}
