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;
const int m = 4;
int numList[m] = {5, 2, 7, 8};
int LIS(int i, int prev) {
  if (i >= m) return 0;
  LIS(i + 1, prev);
  LIS(i + 1, i);
  cout << i << "   " << numList[i] << endl;
}
long long arr[10];
void Merge(int *A, int *L, int leftCount, int *R, int rightCount) {
  int i, j, k;
  for (int i = 0; i < 8; i++) {
    cout << A[i] << " ";
  }
  cout << endl;
  i = 0;
  j = 0;
  k = 0;
  while (i < leftCount && j < rightCount) {
    if (L[i] < R[j])
      A[k++] = L[i++];
    else
      A[k++] = R[j++];
  }
  while (i < leftCount) A[k++] = L[i++];
  while (j < rightCount) A[k++] = R[j++];
  for (int i = 0; i < 8; i++) {
    cout << "l" << L[i] << " ";
  }
  cout << endl;
  for (int i = 0; i < 8; i++) {
    cout << "r" << R[i] << " ";
  }
  cout << endl;
}
void MergeSort(int *A, int n) {
  int mid, i;
  int L[n];
  int R[n];
  if (n < 2) return;
  mid = n / 2;
  for (i = 0; i < mid; i++) {
    L[i] = A[i];
  }
  for (i = mid; i < n; i++) {
    R[i - mid] = A[i];
  }
  MergeSort(L, mid);
  MergeSort(R, n - mid);
  Merge(A, L, mid, R, n - mid);
}
int main() {
  int n, q;
  cin >> n >> q;
  int arr[q][3];
  for (int i = 0; i < q; i++) {
    for (int j = 0; j < 3; j++) {
      cin >> arr[i][j];
    }
  }
  vector<pair<int, int> > num;
  for (int i = 1; i <= n; i++) {
    num.push_back(make_pair(i, 0));
  }
  int tot_time = arr[0][0] + arr[0][2];
  int cnt = arr[0][1];
  int sum = 0;
  for (int i = 0; i < arr[0][1]; i++) {
    sum += num[i].first;
    num[i].second = tot_time;
  }
  cout << sum << endl;
  for (int i = 1; i < q; i++) {
    tot_time = arr[i][0];
    int x = arr[i][2];
    cnt = arr[i][1];
    int ch = 0;
    sum = 0;
    for (int j = 0; j < n; j++) {
      if (cnt <= 0) {
        cout << sum << endl;
        ch = 1;
        break;
      }
      if (tot_time >= num[j].second) {
        sum += num[j].first;
        num[j].second = tot_time + x;
        cnt--;
      }
    }
    if (sum == 0 || cnt > 0) {
      cout << -1 << endl;
    } else if (sum > 0 && cnt <= 0 && ch == 0) {
      cout << sum << endl;
    }
  }
  return 0;
}
