#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int N = 100;
const int Q = 1e5;
const int T = 1e6;
pair<pair<int, int>, int> task[T];
vector<int> server_queue[T];
bool server_available[N];
int num_available_servers;
int res[Q];
int main() {
  ios_base::sync_with_stdio(0);
  int n, q;
  cin >> n >> q;
  for (int(i) = 0; (i) < (n); ++(i)) server_available[i] = 1;
  num_available_servers = n;
  for (int(i) = 0; (i) < (q); ++(i)) {
    int t, k, d;
    cin >> t >> k >> d;
    task[t - 1] = {{k, d}, i};
  }
  for (int(t) = 0; (t) < (T); ++(t)) {
    while (!server_queue[t].empty()) {
      int sid = server_queue[t].back();
      server_queue[t].pop_back();
      server_available[sid] = 1;
      num_available_servers++;
    }
    if (task[t] != make_pair(make_pair(0, 0), 0)) {
      int k = task[t].first.first;
      int d = task[t].first.second;
      int qid = task[t].second;
      if (k <= num_available_servers) {
        for (int i = 0; i < n && k > 0; ++i) {
          if (server_available[i]) {
            res[qid] += i + 1;
            server_available[i] = 0;
            num_available_servers--;
            k--;
            if (t + d < T) {
              server_queue[t + d].push_back(i);
            }
          }
        }
      } else {
        res[qid] = -1;
      }
    }
  }
  for (int(i) = 0; (i) < (q); ++(i)) {
    cout << res[i] << endl;
  }
  return 0;
}
