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>
#pragma comment(linker, "/STACK:16777216")
#pragma warning(disable : 4786)
using namespace std;
string to_string(long long x) {
  stringstream ss;
  ss << x;
  return ss.str();
}
long long to_int(const string &s) {
  stringstream ss;
  ss << s;
  long long x;
  ss >> x;
  return x;
}
vector<pair<int, int> > vs;
int n;
int comp(pair<int, int> p1, pair<int, int> p2) {
  if (p2.second == -1 && p1.second == -1) {
    return p1.first < p2.first;
  } else if (p1.second < p2.second) {
    return true;
  } else if (p1.second == p2.second) {
    return p1.first < p2.first;
  }
  return false;
}
int main(void) {
  int q, i, j, k;
  while (cin >> n >> q) {
    vs.clear();
    for (i = 0; i < n; i++) {
      vs.push_back(make_pair(i + 1, -1));
    }
    int ti, ki, di;
    for (i = 0; i < q; i++) {
      scanf("%d %d %d", &ti, &ki, &di);
      int sum = 0;
      int cnt = 0;
      for (j = 0; j < n; j++) {
        if (vs[j].second == -1) {
          sum += vs[j].first;
          cnt++;
          vs[j].second = ti + di;
        } else if (ti >= vs[j].second) {
          sum += vs[j].first;
          vs[j].second = ti + di;
          cnt++;
        }
        if (cnt == ki) {
          break;
        }
      }
      if (cnt == ki) {
        cout << sum << endl;
      } else {
        cout << -1 << endl;
      }
      sort((vs).begin(), (vs).end(), comp);
    }
  }
  return 0;
}
