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

/*
 * Code Author: Mihir Shah
 * DA-IICT
 */
import java.io.*;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;



public class ProblemC {

	static double eps=(double)1e-6;
	static int mod=(int)1e9+7;
	public static void main(String args[]){
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		//---------------My Code------------------

        int n = in.nextInt();
        int q = in.nextInt();
        int serverFree[] = new int[n];
        for (int i = 0; i < n; i++) {
            serverFree[i] = 0;
        }
        int enterTime[] = new int[q];
        int leaveTime[] = new int[q];
        int numberOfServersRequired[] = new int[q];
        for(int i = 0; i < q; i++) {
            enterTime[i] = in.nextInt();
            numberOfServersRequired[i] = in.nextInt();
            leaveTime[i] = in.nextInt() + enterTime[i] - 1;
            int sum = 0;
            int counter = 0;
            for (int j = 0; j < n; j++) {
                if(serverFree[j] < enterTime[i]) {
                    counter++;
                    // System.out.println(j + 1);
                }
            }
            // System.out.println("Free servers " + counter);
            // System.out.println("Counter " + counter + " Required " + numberOfServersRequired[i]);
            if(counter >= numberOfServersRequired[i]) {
                int tempLoopVariant = 0;
                int tempCounter = numberOfServersRequired[i];
                while(tempCounter != 0) {
                    if(serverFree[tempLoopVariant] < enterTime[i]) {
                        tempCounter--;
                        serverFree[tempLoopVariant] = leaveTime[i];
                        sum += (tempLoopVariant + 1);
                        // System.out.println("Index " + tempLoopVariant);
                    }
                    tempLoopVariant++;
                }
            }
            else {
                sum = -1;
            }
            System.out.println(sum);
        }
        //---------------The End--1----------------
        out.close();
	}

	static long gcd(long x, long y)
	{
		long r=0, a, b;
		a = (x > y) ? x : y; // a is greater number
		b = (x < y) ? x : y; // b is smaller number
		r = b;
		while(a % b != 0)
		{
			r = a % b;
			a = b;
			b = r;
		}
		return r;
	}

	public static void debug(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine(){
			String fullLine=null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine=reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
}
