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;
int n;
int t, sl, len, q;
int id[2000000];
struct data {
  int t, sl, len, p;
} a[2000000];
vector<data> L[2000000];
vector<int> Free[2000000];
vector<int> v;
int ans[2000000];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> q;
  int last = 0, remn = 0, sumid;
  memset(id, 0, sizeof(id));
  for (int i = 1; i <= q; i++) {
    cin >> a[i].t >> a[i].sl >> a[i].len;
    a[i].p = i;
    L[a[i].t].push_back(a[i]);
  }
  for (int thoigian = 1; thoigian <= 1000000; thoigian++) {
    if (Free[thoigian].size())
      for (int i = 0; i < Free[thoigian].size(); i++) id[Free[thoigian][i]] = 0;
    for (int i = 0; i < L[thoigian].size(); i++) {
      int t = L[thoigian][i].t;
      int sl = L[thoigian][i].sl;
      int len = L[thoigian][i].len;
      int vt = L[thoigian][i].p;
      int rem = 0, sumid = 0;
      v.clear();
      for (int j = 1; j <= n; j++)
        if (rem >= sl)
          break;
        else if (id[j] == 0)
          rem++, sumid += j, v.push_back(j);
      if (rem < sl)
        ans[vt] = -1;
      else {
        for (int j = 0; j < v.size(); j++) {
          int u = v[j];
          Free[t + len].push_back(u);
          id[u] = 1;
        }
        ans[vt] = sumid;
      }
    }
  }
  for (int i = 1; i <= q; i++) cout << ans[i] << endl;
  return 0;
}
