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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;


public class problem1{

	public static void main(String[]args) throws IOException {
		//BufferedReader ll = new BufferedReader(new FileReader("input.txt"));
        BufferedReader ll = new BufferedReader(new InputStreamReader(System.in));  
        String[] t = ll.readLine().split(" ");
        int n = Integer.parseInt(t[0]);
        int q = Integer.parseInt(t[1]);
        int[] serv = new int[n];
        int[] time = new int[n];
        StringBuilder out = new StringBuilder("");
        for(int i=1;i<=n;i++)
        	serv[i-1] = i;
        for(int i=1;i<n;i++)
        	serv[i] = serv[i]+serv[i-1];
        for(int i=0;i<q;i++){
        	t = ll.readLine().split(" ");
        	int ti = Integer.parseInt(t[0]);
        	int k = Integer.parseInt(t[1]);
        	int di = Integer.parseInt(t[2]);
        	boolean check = false;
        	int count = 0;
        	int index = -1;
        	for(int j=0;j<n;j++){
        		if(time[j]<ti){
        			count++;
        		}
        		else {
        			count = 0;
        		}
        		if(count == k){
        			index = j;
        			break;
        			
        		}
        	}
        	if(count == k){
        		for(int j=index;j>(index-k);j--)
        			time[j] = ti+di-1;
        		int val = serv[index]- serv[(index-k)+1]+((index-k)+2);
        		out.append(val+"\n");
        	}
        	else{
        		out.append("-1\n");
        	}
        }
        System.out.println(out.substring(0,out.length()));
	}
}