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 = 1e9;
const int N = 100;
const int Q = 1e5;
const int T = 1e6;
pair<pair<int, int>, int> task[T];
vector<int> server_queue[T];
bool server_available[N];
int num_available_servers;
int res[Q];
int main() {
  ios_base::sync_with_stdio(0);
  int n, q;
  cin >> n >> q;
  for (int(i) = 0; (i) < (n); ++(i)) server_available[i] = 1;
  num_available_servers = n;
  for (int(i) = 0; (i) < (q); ++(i)) {
    int t, k, d;
    cin >> t >> k >> d;
    task[t - 1] = {{k, d}, i};
  }
  for (int(t) = 0; (t) < (T); ++(t)) {
    while (!server_queue[t].empty()) {
      int sid = server_queue[t].back();
      server_queue[t].pop_back();
      server_available[sid] = 1;
      num_available_servers++;
    }
    if (task[t] != make_pair(make_pair(0, 0), 0)) {
      int k = task[t].first.first;
      int d = task[t].first.second;
      int qid = task[t].second;
      if (k <= num_available_servers) {
        for (int i = 0; i < n && k > 0; ++i) {
          if (server_available[i]) {
            res[qid] += i + 1;
            server_available[i] = 0;
            num_available_servers--;
            k--;
            if (t + d < T) {
              server_queue[t + d].push_back(i);
            }
          }
        }
      } else {
        res[qid] = -1;
      }
    }
  }
  for (int(i) = 0; (i) < (q); ++(i)) {
    cout << res[i] << endl;
  }
  return 0;
}
