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.util.*;

public class Main {
	private static class Task {
		int start;
		int required;
		int end;
		int[] occupied;
		
		public Task(int start, int required, int end, int n) {
			this.start = start;
			this.required = required;
			this.end = end;
			
			occupied = new int[n+1];
		}
	}
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int q = sc.nextInt();
		
		List<Task> tasks= new ArrayList<Task>();
		for(int p=0; p<q; p++) {
			int start = sc.nextInt();
			int required = sc.nextInt();
			int end = sc.nextInt() + start - 1;
			
			tasks.add(new Task(start, required, end, n));
		}
		
		//int maxT = tasks.get(tasks.size()-1).end+1;
		
		//int[][] occupied = new int[maxT][n+1];
		
		for(int p=0; p<q; p++) {
			int start = tasks.get(p).start;
			int required = tasks.get(p).required;
			int end = tasks.get(p).end;
			
			int rem = n - tasks.get(p).occupied[0];
			if(rem >= required) {
				int s = 0;
				int count = 0;
				for(int i=1; i<=n; i++) {
					if(tasks.get(p).occupied[i] == 0) {
						++count;
						s += i;
						for(int j=p+1; j<q; j++) {
							if(tasks.get(j).start <= end) {
								++tasks.get(j).occupied[0];
								tasks.get(j).occupied[i] = 1;
							} else {
								break;
							}
						}
						
						if(count >= required) break;
					}
				}
				
				System.out.println(s);
			} else {
				System.out.println("-1");
			}
		}
	}
}
