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;
const int N6 = 1e6 + 6;
const int N9 = 1e9 + 7;
long long n, sm[111], ggwp = 0;
bool u[111];
pair<long long, pair<long long, long long> > t[100005];
vector<pair<long long, pair<long long, pair<long long, long long> > > > s;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(NULL);
  long long q;
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) sm[i] = sm[i - 1] + i;
  long long srv = n, l = 0, r = 0;
  bool tr = false;
  for (int i = 1; i <= q; ++i) {
    cin >> t[i].first >> t[i].second.first >> t[i].second.second;
    for (int j = 0; j < s.size(); ++j) {
      if (s[j].first + s[j].second.second.first > t[i].first)
        continue;
      else {
        srv += s[j].second.first;
        long long cnt = 0;
        for (int qwe = s[j].second.second.second;
             qwe <= n && cnt != s[j].second.first; ++qwe) {
          if (u[qwe]) u[qwe] = 0, ++cnt;
        }
      }
    }
    if (t[i].second.first > srv)
      cout << "-1\n";
    else {
      long long cnt = 0, ans = 0;
      ggwp = 0;
      for (int j = 1; j <= n && cnt != t[i].second.first; ++j) {
        if (!u[j]) {
          if (ggwp == 0) ggwp = j;
          u[j] = 1;
          ++cnt;
          ans += j;
        }
      }
      cout << ans << '\n';
      srv -= t[i].second.first;
      s.push_back(make_pair(
          t[i].first,
          make_pair(t[i].second.first, make_pair(t[i].second.second, ggwp))));
    }
  }
  return 0;
}
