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
#define float double
#define null NULL
#define vi vector<int>
#define pb push_back
#define pra(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" ";}cout<<endl;
#define prv(v) for(auto it: v){cout<<it<<" ";}cout<<endl;
#define mod 1000000007
using namespace std;


int fact[1000000];
int factorial(int n)
{
	fact[0] = 1;
	for (int i = 1; i <= n; i++) {
		fact[i] = (fact[i - 1] % mod * i % mod) % mod;
	}
	return fact[n] % mod;
}

int power(int x, int y)
{
	int temp;
	if ( y == 0)
		return 1;
	temp = power(x, y / 2);
	if (y % 2 == 0)
		return temp * temp;
	else
		return x * temp * temp;
}
int nCk(int n, int k)
{
	if (k > n - k)
		k = n - k;
	int ans = 1;
	for (int i = 0; i < k; i++)
	{
		ans *= (n - i);
		ans /= (i + 1);
	}
	return ans;
}

vi factorization(int n)
{
	vi factors;
	//factors.pb(1);
	for (int d = 2; d * d <= n; d++)
	{
		while (n % d == 0)
		{
			factors.pb(d);
			n /= d;
		}
	}
	if (n > 1)
		factors.pb(n);
	return factors;
}

vi divisors(int n)
{
	vi divisors;

	for (int i = 2; i * i <= n; i++)
	{
		if ( n % i == 0)
		{
			if (n / i == i)
				divisors.pb(i);
			else
				divisors.pb(i), divisors.pb(n / i);
		}
	}
	return divisors;
}

int sieve[1000001];
void SOE()
{
	sieve[0] = 0;
	sieve[1] = 0;
	for (int i = 2; i <= 1000000; i++)
	{
		if (sieve[i])
		{
			for (int j = 2; j * i < 1000000; j++)
				sieve[j * i] = 0;
		}
	}
}

bool isPrime(int x)
{
	if (x == 1) return 0;
	for (int i = 2; i * i <= x; ++i)
	{
		if (x % i == 0)
			return false;
	}
	return true;
}

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif

	int t = 1;
	//	cin >> t;
	while (t--)
	{
		int n, q; cin >> n >> q;
		int servers[n] = {0};
		while(q--)
		{
			int t, k, d;
			cin >> t >> k >> d;
			int machines = 0;
			for(int j = 0; j < n; j++) {
				if(servers[j] <= t) {
					servers[j] = t + d;
					machines += j + 1;
					k--;
				}
				if(k == 0)
					break;
			}
			cout << (k==0?machines:-1) << endl;
		}
	}


#ifndef ONLINE_JUDGE
	cout << "\nTime Elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " sec\n";
#endif
return 0;
}