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

public class Main {
    static FastScanner in;
    static int n, q;

    public static void main(String[] args) throws IOException {
        //      Scanner in = new Scanner(new File("input.txt"));
        //        Scanner in = new Scanner(System.in);
        in = new FastScanner(System.in);
        //        in = new FastScanner("input.txt");
        //        System.setOut(new PrintStream(new BufferedOutputStream(new FileOutputStream("out.txt")), true));
        n = in.nextInt();
        q = in.nextInt();
        PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
        PriorityQueue<Job> queue = new PriorityQueue<Job>(1, new JobComparator());
        for (int i = 1; i <= n; i++) {
            pq.offer(i);
        }
        while (q-- > 0) {
            int t = in.nextInt();
            int k = in.nextInt();
            int d = in.nextInt();
            while (!queue.isEmpty()) {
                if (queue.peek().end < t) {
                    pq.offer(queue.remove().id);
                } else
                    break;
            }
            if (k > pq.size()) {
                System.out.println(-1);
            } else {
                int sum = 0;
                while (k-- > 0) {
                    int id = pq.poll();
                    int end = t + d - 1;
                    queue.offer(new Job(id, end));
                    sum += id;
                }
                System.out.println(sum);
            }
        }
    }
}

class Job {
    int id;
    Integer end;

    public Job(int id, int end) {
        this.id = id;
        this.end = end;
    }
}

class JobComparator implements Comparator<Job> {

    @Override
    public int compare(Job o1, Job o2) {
        return o1.end.compareTo(o2.end);
    }

}

class FastScanner {

    BufferedReader br;
    StringTokenizer tokenizer;

    FastScanner(String fileName) throws FileNotFoundException {
        this(new FileInputStream(new File(fileName)));
    }

    FastScanner(InputStream is) {
        br = new BufferedReader(new InputStreamReader(is));
    }

    String nextLine() throws IOException {
        tokenizer = null;
        return br.readLine();
    }

    String next() throws IOException {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            String line = br.readLine();
            if (line == null) {
                return null;
            }
            tokenizer = new StringTokenizer(line);
        }
        return tokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    char nextChar() throws IOException {
        return next().charAt(0);
    }
}