#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long int infLL = 90000000000000000;
int MOD1 = 1000000007;
int MOD2 = 1000000009;
inline bool checkBit(long long int n, long long int i) {
  return n & (1LL << i);
}
inline long long int setBit(long long int n, long long int i) {
  return n | (1LL << i);
  ;
}
inline long long int resetBit(long long int n, long long int i) {
  return n & (~(1LL << i));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
  a %= 1000000000007LL;
  (a < 0) && (a += 1000000000007LL);
}
inline long long int modMul(long long int a, long long int b) {
  a %= 1000000000007LL, b %= 1000000000007LL;
  normal(a), normal(b);
  return (a * b) % 1000000000007LL;
}
inline long long int modAdd(long long int a, long long int b) {
  a %= 1000000000007LL, b %= 1000000000007LL;
  normal(a), normal(b);
  return (a + b) % 1000000000007LL;
}
inline long long int modSub(long long int a, long long int b) {
  a %= 1000000000007LL, b %= 1000000000007LL;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long int modPow(long long int b, long long int p) {
  long long int r = 1LL;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1LL;
  }
  return r;
}
inline long long int modDiv(long long int a, long long int b) {
  return modMul(a, modPow(b, 1000000000007LL - 2));
}
long long int converter(string a) {
  long long int i, mul = 1, r, t, ans = 0LL;
  if (a.length() == 0) return 0;
  for (i = a.length() - 1; i >= 0; i--) {
    t = a[i] - '0';
    r = t % 10;
    ans += (mul * r);
    mul = mul * 10;
  }
  return ans;
}
long long int shesh[100005], lagbe[100005], dhukbe[100005], End_list[100005];
int main() {
  long long int n, f, i, time_b, server_b, cur = 0LL, l, r, o, start, need,
                                           last = 0, j, x, gap, free;
  cin >> n >> f;
  for (i = 1; i <= f; i++) {
    cin >> dhukbe[i] >> lagbe[i] >> shesh[i];
  }
  for (i = 1; i <= 1005; i++) End_list[i] = 0;
  free = n;
  for (i = 1; i <= f; i++) {
    need = lagbe[i];
    start = dhukbe[i];
    cur = 0LL;
    free = 0LL;
    for (j = 1; j <= n; j++) {
      if (End_list[j] < start) free++;
    }
    if (need > free) {
      cout << "-1" << '\n';
      continue;
    }
    for (j = 1; j <= n && need; j++) {
      if (End_list[j] < start) {
        need--;
        cur += j;
        End_list[j] = shesh[i] + dhukbe[i] - 1;
      }
    }
    cout << cur << '\n';
  }
  return 0;
}
