#include <bits/stdc++.h>
using namespace std;
struct O {
  int t, k, d, id;
  bool operator<(const O& o) const { return t < o.t; }
};
const int MXQ = 1e5 + 1;
int ID[(int)1e6 + 1] = {};
int ans[MXQ] = {};
O qs[MXQ] = {};
int main() {
  int N, Q;
  cin >> N >> Q;
  priority_queue<int, vector<int>, greater<int> > pq;
  priority_queue<pair<int, int> > ret;
  for (int x = 0; x < N; x++) pq.push(x + 1);
  for (int x = 0; x < Q; x++)
    qs[x].id = x, cin >> qs[x].t >> qs[x].k >> qs[x].d, ID[qs[x].t] = x + 1;
  sort(qs, qs + Q);
  for (int x = 1; x <= (int)1e6; x++) {
    while (!ret.empty() && -ret.top().first == x)
      pq.push(ret.top().second), ret.pop();
    if (ID[x]) {
      int k = qs[ID[x] - 1].k, d = qs[ID[x] - 1].d;
      if (((int)(pq).size()) >= k) {
        while (k--) {
          int tmp = pq.top();
          pq.pop();
          ans[qs[ID[x] - 1].id] += tmp;
          ret.push({-(d + x), tmp});
        }
      } else {
        ans[qs[ID[x] - 1].id] = -1;
      }
    }
  }
  for (int x = 0; x < Q; x++) cout << ans[x] << "\n";
}
