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>
#define int long long

using namespace std;

const int maxN = 2e6;

int readInt()
{
    bool minus = false;
    int result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-')
            break;
        if (ch >= '0' && ch <= '9')
            break;
        ch = getchar();
    }
    if (ch == '-')
        minus = true;
    else
        result = ch - '0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9')
            break;
        result = result * 10 + (ch - '0');
    }
    if (minus)
        return -result;
    else
        return result;
}
int cnt, r, a1, an, N, sum;
int t[maxN + 1];
void inc(int id, int delta)
{
    for (; id <= maxN; id = (id | (id - 1)) + 1) {
        t[id] += delta;
    }
}
int Sum(int id)
{
    int res = 0;
    for (; id > 0; id = (id & (id - 1))) {
        res += t[id];
    }
    return res;
}
void solve(int ti, int k, int d, int n) {
    sum = Sum(ti);
    int ans = -1;
    if(sum >= k) {
        a1 = n - sum + 1;
        N = k;
        an = a1 + N - 1;
        ans = ((a1 + an) * N) / 2;
        inc(ti, -k);
        inc(ti + d, +k);
    }
    printf("%I64d\n", ans);
}
main()
{
    int n = readInt(), q = readInt();
    int ti = readInt(), k = readInt(), d = readInt();
    inc(ti, n);
    solve(ti, k, d, n);
    q--;
    while (q--) {
        ti = readInt(), k = readInt(), d = readInt();
        solve(ti, k, d, n);
    }
}
