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;
vector<int> v[100007];
vector<pair<int, int> > ve;
pair<pair<int, int>, int> a[100007];
int b[100007];
bool ok[1007] = {0};
bool dcp(pair<int, int> x, pair<int, int> y) {
  if (x.first != y.first)
    return (x.first < y.first);
  else
    return (x.first < y.first);
}
signed main() {
  int q, n;
  cin >> n;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    cin >> a[i].first.first >> a[i].second >> a[i].first.second;
    ve.push_back(make_pair(a[i].first.first, i));
    ve.push_back(make_pair(a[i].first.second + a[i].first.first, -i));
  }
  sort(ve.begin(), ve.end(), dcp);
  int dem = n;
  for (int i = 0; i < ve.size(); i++) {
    int k = ve[i].second;
    if (k > 0) {
      if (dem >= a[k].second) {
        dem -= a[k].second;
        for (int j = 1; j <= n; j++) {
          if (!ok[j]) {
            v[k].push_back(j);
            ok[j] = 1, b[k] += j;
          }
          if (v[k].size() == a[k].second) break;
        }
      } else {
        b[k] = -1;
        continue;
      }
    } else {
      k = -k;
      dem += v[k].size();
      while (v[k].size() > 0) ok[v[k][v[k].size() - 1]] = 0, v[k].pop_back();
    }
  }
  for (int i = 1; i <= q; i++) cout << b[i] << endl;
  return 0;
}
