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 {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt(),q = input.nextInt();
        int[] time = new int[n+1];
        for (int i=1;i<=n;i++)time[i]=0;
        for (int i=0;i<q;i++){
            int ti = input.nextInt(),ni = input.nextInt(),di = input.nextInt();
            int enableUse = 0;
            int ans = 0;
            int count = 0;
            for(int j=1;j<=n;j++){
                if(time[j]<=ti)enableUse++;
            }
            if(enableUse<ni){
                System.out.println(-1);
            }else {
                for (int j=1;j<=n&&count<ni;j++){
                    if(time[j]<=ti){
                        time[j]=ti+di;
                        ans+=j;
                        count++;
                    }
                }
                System.out.println(ans);
            }
        }
    }

    public static int minCost(int[] array) {
        int len = array.length;
        if (len == 0 || len == 1) {
            return 0;
        }
        int sum = 0;
        LinkedList<Integer> queue = new LinkedList<>();
        Arrays.sort(array);
        queue.offer(array[0]);
        for (int i = 1; i < len; i++) {
            int temp = queue.getLast();
            if (array[i] <= temp) {
                sum += temp - array[i] + 1;
                queue.addLast(temp + 1);
            } else {
                queue.addLast(temp);
            }
        }
        return sum;
    }

    public static int mixx(int a, int b, int c) {
        return Math.min(Math.min(a, b), c);
    }
}


	 				 			  		 		   		    		