#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
using pii = pair<int, int>;
using vi = vector<int>;
const int N = 100005;
int t[N], k[N], d[N];
int tim[N];
set<int> fr;
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= q; ++i) {
    scanf("%d%d%d", &t[i], &k[i], &d[i]);
    int inter = t[i] - t[i - 1];
    int ans = 0;
    for (int j = 1; j <= n; ++j) {
      tim[j] = max(0, tim[j] - inter);
      if (tim[j] == 0) fr.insert(j);
    }
    if (fr.size() >= k[i]) {
      ans = 0;
      int need = k[i];
      for (set<int>::iterator it = fr.begin(); it != fr.end();) {
        if (need == 0) break;
        tim[*it] = d[i];
        ans += (*it);
        need--;
        fr.erase(it++);
      }
    } else {
      ans = -1;
    }
    printf("%d\n", ans);
  }
  return 0;
}
