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;
long long N, Q, RS[100100], kn;
bool KN[110];
struct my {
  long long k, ind;
};
vector<my> T[1010100], E[1010100];
bool B[100100][110];
string S;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> Q;
  for (long long i = 0, t, d, k; i < Q; i++) {
    cin >> t >> k >> d;
    my a;
    a.ind = i;
    a.k = k;
    T[t].push_back(a);
    E[t + d - 1].push_back(a);
  }
  for (int i = 0; i < 1010000; i++) {
    if (!T[i].empty()) {
      my a = T[i][0];
      if (a.k + kn <= N) {
        long long s = 0;
        kn += a.k;
        for (long long j = 1; j <= N && a.k > 0; j++)
          if (!KN[j]) {
            s += j;
            a.k--;
            KN[j] = B[a.ind][j] = 1;
          }
        RS[a.ind] = s;
      } else
        RS[a.ind] = -1;
    }
    if (!E[i].empty())
      for (auto it = E[i].begin(); it != E[i].end(); it++) {
        kn -= it->k;
        for (int j = 1; j <= N; j++)
          if (KN[j] && B[it->ind][j]) KN[j] = 0;
      }
  }
  for (int i = 0; i < Q; i++) cout << RS[i] << '\n';
}
