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>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int maxn = 100000 + 100;
int t[maxn], k[maxn], d[maxn];
int inq[maxn];
int ans[maxn];
int main() {
  int n, q;
  ios::sync_with_stdio(false);
  while (cin >> n >> q) {
    memset(ans, 0, sizeof(ans));
    memset(inq, 0, sizeof(inq));
    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        Q;
    int lef = n;
    for (int i = 0; i < q; i++) {
      cin >> t[i] >> k[i] >> d[i];
    }
    int tm = 0;
    for (int i = 0; i < q; i++) {
      tm = t[i];
      while (!Q.empty()) {
        if (Q.top().first <= tm) {
          inq[Q.top().second] = false;
          lef++;
          Q.pop();
        } else {
          break;
        }
      }
      if (lef >= k[i]) {
        int pp = 1;
        for (int j = 0; j < k[i]; j++) {
          while (inq[pp]) {
            pp++;
          }
          Q.push({tm + d[i], pp});
          inq[pp] = true;
          lef--;
          ans[i] += pp;
        }
      } else {
        ans[i] = -1;
      }
    }
    for (int i = 0; i < q; i++) {
      cout << ans[i] << endl;
    }
  }
  return 0;
}
