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;
long long int gcd(long long int a, long long int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
long long int n;
bool cmp(pair<char, int> p1, pair<char, int> p2) {
  return p1.second < p2.second;
}
struct node {
  int time;
  int num;
  vector<int> id;
  bool operator<(const node& tn) const { return time > tn.time; }
};
priority_queue<node> qu;
bool visited[105];
int main() {
  int n, q;
  cin >> n >> q;
  int sum = n;
  for (int i = 0; i < q; i++) {
    int t, k, d;
    cin >> t >> k >> d;
    if (!qu.empty()) {
      while (!qu.empty() && qu.top().time <= t) {
        n += qu.top().num;
        for (int j = 0; j < qu.top().id.size(); j++) {
          visited[qu.top().id[j]] = 0;
        }
        qu.pop();
      }
    }
    if (n >= k) {
      vector<int> tmp;
      tmp.clear();
      int cnt = k;
      long long int ans = 0;
      for (int j = 1; j < sum + 1; j++) {
        if (!visited[j]) {
          visited[j] = 1;
          tmp.push_back(j);
          ans += j;
          n--;
          cnt--;
          if (cnt == 0) break;
        }
      }
      qu.push({t + d, k, tmp});
      cout << ans << endl;
    } else
      cout << "-1" << endl;
  }
  return 0;
}
