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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ROCK ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f first
#define sec second
using namespace std;
using namespace __gnu_pbds ;
const long long int inf =(long long)1e18;
const int dx[4] = {0, 0, 1, -1},dy[4] = {1, -1, 0, 0};
typedef long long int ll;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

vector<pair<int,pair<int,int> > >v;
set<int>st;
map<int,int>mp;

int main()
{
    ROCK;
    int n,q;cin>>n>>q;
    for(int i=0;i<q;i++){
        int t,k,d;cin>>t>>k>>d;
        v.push_back({t,{k,d}});
    }
    int lst=1;
    for(auto i : v){
        int t=i.f;
        int k=i.sec.f;
        int d=i.sec.sec;
        int sum=0;
        for(int i=1;i<=n;i++){
            if(t>=mp[i] && st.find(i)!=st.end()){
                lst=min(lst,i);
                st.erase(st.find(i));
            }
        }
        int av=n-st.size();
        if(av>=k){
          for(int j=lst,cnt=0;j<=n && cnt<k ;j++,cnt++){
              st.insert(j);
              mp[j]=t+d;
              lst=j+1;
              sum+=j;

          }cout<<sum<<endl;
        }else cout<<-1<<endl;
    }

    return 0;
}
