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;
using ll = long long;
using pii = pair<int, int>;
using vb = vector<bool>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vvvpii = vector<vvpii>;
template <typename T>
T read() {
  T t;
  cin >> t;
  return t;
}
template <class T, class U>
ostream& operator<<(ostream& o, const pair<T, U>& p) {
  o << '(' << p.first << ", " << p.second << ')';
  return o;
}
template <typename T>
vector<int> compress(vector<T>& orig) {
  vector<int> ret(orig.size());
  vector<T> a(orig);
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  for (size_t i = 0; i < orig.size(); i++) {
    ret[i] = distance(a.begin(), lower_bound(a.begin(), a.end(), orig[i])) + 0;
  }
  return ret;
}
void Main() {
  int n = read<int>();
  int m = read<int>();
  vector<pair<int, pii>> Q(m);
  for (int i = int(0); i < int(m); ++i) {
    Q[i].first = read<int>();
    Q[i].second.second = read<int>();
    Q[i].second.first = Q[i].first + read<int>();
  }
  priority_queue<int, vector<int>, greater<int>> q;
  for (int i = int(0); i < int(n); ++i) q.emplace(i + 1);
  priority_queue<pii, vector<pii>, greater<pii>> rq;
  for (auto&& j : Q) {
    while (!rq.empty() && rq.top().first <= j.first) {
      q.emplace(rq.top().second);
      rq.pop();
    }
    vi u;
    while (!q.empty() && ((int)(u).size()) < j.second.second) {
      u.emplace_back(q.top());
      q.pop();
    }
    int ans;
    if (((int)(u).size()) == j.second.second) {
      ans = 0;
      for (auto&& a : u) {
        ans += a;
        rq.emplace(j.second.first, a);
      }
    } else {
      for (auto&& a : u) q.emplace(a);
      ans = -1;
    }
    cout << ans << endl;
  }
}
int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  Main();
  return 0;
}
