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

/**
 * Created by LNTK
 */
public class C {
    static class Server{
        int remainTime;
        boolean isReady;
        Server(){
            remainTime = 0;
            isReady = true;
        }
    }

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int q = input.nextInt();
        Server[] server = new Server[n + 1];
        for (int i = 1; i <= n; i++){
            server[i] = new Server();
        }
        ArrayList<Integer> freeServers = new ArrayList<Integer>();
        ArrayList<Integer> busyServers = new ArrayList<Integer>();
        for (int i = 1; i <= n; i++){
            freeServers.add(i);
        }

        int lastT = 0;

        for (int i = 0; i < q; i++){
            int t = input.nextInt();
            int k = input.nextInt();
            int d = input.nextInt();

            int timePassed = t - lastT;
            ArrayList<Integer> removeList = new ArrayList<Integer>();
//            System.out.println("busy: " + busyServers);
            for (int j : busyServers){
                server[j].remainTime -= timePassed;
                if (server[j].remainTime <= 0){
                    server[j].remainTime = 0;
                    server[j].isReady = true;
                    removeList.add(j);
                    freeServers.add(j);
                }
            }
            for (int j : removeList){
                busyServers.remove(new Integer(j));
//                System.out.println("busy: " + busyServers);
            }

//            for (int j = 1; j <= n; j++){
//                System.out.println("server "  + j + "  time " + server[j].remainTime + "  ready ? ->> " + server[j].isReady);
//            }

            Collections.sort(freeServers, new Comparator<Integer>() {
                @Override
                public int compare(Integer a, Integer b)
                {
                    if (a > b) return 1;
                    if (a < b) return -1;
                    return 0;
                }
            });

            Collections.sort(busyServers, new Comparator<Integer>() {
                @Override
                public int compare(Integer a, Integer b)
                {
                    if (a > b) return 1;
                    if (a < b) return -1;
                    return 0;
                }
            });

//            System.out.println("free:" + freeServers);
            if (freeServers.size() >= k){
                int sum = 0;
                for (int j = 1; j <= k; j++){
                    int freeId = freeServers.get(0);
//                    System.out.println("id: " + freeId);
                    sum += freeId;
                    server[freeId].isReady = false;
                    server[freeId].remainTime = d;
                    freeServers.remove(0);
                    busyServers.add(freeId);
//                    System.out.println("free:" + freeServers);
                }

                System.out.println(sum);
            }else {
                System.out.println(-1);
            }

            lastT = t;
        }
    }
}
