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;
bool scan_d(int &num) {
  char in;
  bool IsN = false;
  in = getchar();
  if (in == EOF) return false;
  while (in != '-' && (in < '0' || in > '9')) {
    if (in == EOF) return false;
    in = getchar();
  }
  if (in == '-') {
    IsN = true;
    num = 0;
  } else
    num = in - '0';
  while (in = getchar(), in >= '0' && in <= '9') {
    num *= 10, num += in - '0';
  }
  if (IsN) num = -num;
  return true;
}
bool scan_lf(double &num) {
  char in;
  double Dec = 0.1;
  bool IsN = false, IsD = false;
  in = getchar();
  if (in == EOF) return false;
  while (in != '-' && in != '.' && (in < '0' || in > '9')) in = getchar();
  if (in == '-') {
    IsN = true;
    num = 0;
  } else if (in == '.') {
    IsD = true;
    num = 0;
  } else
    num = in - '0';
  if (!IsD) {
    while (in = getchar(), in >= '0' && in <= '9') {
      num *= 10;
      num += in - '0';
    }
  }
  if (in != '.') {
    if (IsN) num = -num;
    return true;
  } else {
    while (in = getchar(), in >= '0' && in <= '9') {
      num += Dec * (in - '0');
      Dec *= 0.1;
    }
  }
  if (IsN) num = -num;
  return true;
}
void print_d(int num) {
  bool flag = false;
  if (num < 0) {
    putchar('-');
    num = -num;
  }
  int ans[10], top = 0;
  while (num != 0) {
    ans[top++] = num % 10;
    num /= 10;
  }
  if (top == 0) putchar('0');
  for (int i = top - 1; i >= 0; i--) {
    char ch = ans[i] + '0';
    putchar(ch);
  }
}
int vis[120];
struct node {
  int t, k, d;
  int ma[120];
  int v;
  friend bool operator<(node a, node b) {
    if (a.t != b.t)
      return a.t > b.t;
    else
      return a.v > b.v;
  }
} a;
bool cmp(node a, node b) { return a.t < b.t; }
priority_queue<node> q;
int main() {
  int n, qq;
  scanf("%d%d", &n, &qq);
  for (int i = 1; i <= qq; i++) {
    scan_d(a.t);
    scan_d(a.k);
    scan_d(a.d);
    a.v = 1;
    q.push(a);
  }
  memset(vis, 0, sizeof(vis));
  int use = 0;
  while (!q.empty()) {
    a = q.top();
    q.pop();
    if (a.v == 1) {
      if (n - use < a.k) {
        printf("-1\n");
      } else {
        int ans = 0;
        int num = 0;
        int cnt = 0;
        for (int j = 1; j <= n; j++) {
          if (vis[j] == 0) {
            num++;
            ans += j;
            a.ma[cnt++] = j;
            vis[j] = 1;
          }
          if (num == a.k) {
            break;
          }
        }
        print_d(ans);
        putchar('\n');
        a.v = -1;
        a.t += a.d;
        q.push(a);
        use += a.k;
      }
    } else {
      for (int i = 0; i < a.k; i++) {
        vis[a.ma[i]] = 0;
      }
      use -= a.k;
    }
  }
}
