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

import java.io.*;
import java.util.*;
import java.lang.*;

public class Rextester{
    static class Task implements Comparable<Task>{
        int start,need,end;
        public Task(int start,int need,int d){
            this.start = start;
            this.need = need;
            this.end = start+d;
        }
        @Override
        public int compareTo(Task o){
            return this.start - o.start;
        }
    }
    public static void main(String[] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = new Integer(st.nextToken());
        int q = new Integer(st.nextToken());
        int[] servers = new int[n];
        Arrays.fill(servers,-1);
        StringBuffer sb = new StringBuffer();
        Task[] ts = new Task[q];
        for(int i=0;i<q;i++){
            StringTokenizer st1 = new StringTokenizer(br.readLine());
            ts[i]=new Task(new Integer(st1.nextToken()),new Integer(st1.nextToken()),new Integer(st1.nextToken()));
        }
        br.close();
        Arrays.sort(ts);
        for(int i=0;i<q;i++){
            int sum = 0;
            ArrayList<Integer> given = new ArrayList<Integer>();
            int start = ts[i].start;
            for(int j=0;j<n;j++){
                if(servers[j]<=start){
                    servers[j]=-1;
                }
            }
            for(int j=0;j<n;j++){
                if(ts[i].need==0){
                    break;
                }
                if(servers[j]==-1){
                    sum+=j+1;
                    servers[j]=ts[i].end;
                    ts[i].need--;
                    given.add(j);
                }
            }
            if(ts[i].need>0){
                sb.append("-1").append("\n");
                for(int j=0;j<given.size();j++){
                    servers[given.get(j)]=-1;
                }
            }
            else{
                sb.append(sum).append("\n");
            }
                
        }
        System.out.println(sb);
    }
}
        
                    
                    
                          
                    
        