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;
void fastio() {
  ios::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
}
struct rec {
  long long flg;
  long long end;
};
int main() {
  fastio();
  long long i, j, n, q;
  cin >> n >> q;
  struct rec serv[n + 1];
  long long arry[q][3];
  for (i = 0; i < q; i++) cin >> arry[i][0] >> arry[i][1] >> arry[i][2];
  for (i = 0; i < n + 1; i++) {
    serv[i].flg = 0;
    serv[i].end = -5;
  }
  long long t = 0;
  long long k = 0;
  long long servcnt = n;
  while (k != q) {
    t++;
    for (i = 1; i < n + 1; i++) {
      if (serv[i].end == t) {
        serv[i].flg = 0;
        serv[i].end = -5;
        servcnt++;
      }
    }
    if (t == arry[k][0]) {
      if (servcnt < arry[k][1]) {
        cout << -1 << endl;
        k++;
      } else {
        long long scnt = arry[k][1];
        long long ans = 0;
        for (i = 1; i < n + 1; i++) {
          if (serv[i].flg == 0) {
            serv[i].flg = 1;
            serv[i].end = arry[k][2] + t;
            ans += i;
            scnt--;
            if (scnt == 0) {
              break;
            }
          }
        }
        cout << ans << endl;
        servcnt -= arry[k][1];
        k++;
      }
    }
  }
  return (0);
}
