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;
class Helper {
 public:
  long long x1;
  long long x2;
  long long p;
  Helper(long long x1, long long x2, long long p) {
    this->x1 = x1;
    this->x2 = x2;
    this->p = p;
  }
  bool operator<(const Helper &o) const { return this->p < o.p; }
};
void seive();
void solve();
int primes[100001];
int spf[100001];
void seive() {
  for (int i = 0; i < 100001; i++) {
    spf[i] = i;
  }
  for (int i = 2; i < 100001; i++) {
    primes[i] = 1;
  }
  primes[0] = 0;
  primes[1] = 0;
  for (int i = 2; i * i <= 100001; i++) {
    if (primes[i] == 1) {
      spf[i] = i;
      for (int j = i * i; j < 100001; j += i) {
        spf[j] = i;
        primes[j] = 0;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  cout << endl;
  return 0;
}
void solve() {
  int n, q;
  cin >> n >> q;
  vector<int> used(n + 2, 0);
  for (int i = 0; i < q; i++) {
    int t, k, d;
    cin >> t >> k >> d;
    int start = -1;
    vector<int> res;
    for (int s = 1; s <= n; s++) {
      if (used[s] < t && s + k - 1 <= n && used[s + k - 1] < t) {
        res.push_back(s);
      }
    }
    if (res.size() == 0) {
      cout << -1 << endl;
    } else {
      bool ff = false;
      for (int j = 0; j < res.size(); j++) {
        start = res[j];
        int end = start + k - 1;
        bool f = true;
        for (int x = start; x <= end; x++) {
          if (used[x] >= t) {
            f = false;
            break;
          }
        }
        if (f == true) {
          for (int x = start; x <= end; x++) {
            used[x] = t + d - 1;
          }
          ff = true;
          cout << ((end) * (end + 1)) / 2 - ((start) * (start - 1)) / 2 << endl;
          break;
        }
      }
      if (!ff) {
        cout << -1 << endl;
      }
    }
  }
}
