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 Servers
{
    public static void main(String args[])
    {
        Scanner scn = new Scanner(System.in);
        int i, j;
        int n = scn.nextInt();
        int q = scn.nextInt();
        int t[] = new int[q];
        int k[] = new int[q];
        int d[] = new int[q];
        for(i = 0;i < q; ++i)
        {
            t[i] = scn.nextInt();
            k[i] = scn.nextInt();
            d[i] = scn.nextInt();
        }
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(i = 1;i <= n; ++i)
        {
            map.put(i , 0);
        }
        for(i = 0;i < q; ++i)
        {
            int count = 0;
            for(Map.Entry<Integer, Integer> entry: map.entrySet())
            {
                Integer key = entry.getKey();
                Integer value = entry.getValue();
                if(value < t[i])
                    count++;
            }
            if(count < k[i])
            {
                System.out.println(-1);
            }
            else
            {
                int sum = 0;
                count = 0;
                for(Map.Entry<Integer, Integer> entry: map.entrySet())
                {
                    Integer key = entry.getKey();
                    Integer value = entry.getValue();
                    if(value < t[i])
                    {
                        sum += key;
                        map.put(key, t[i] + d[i]);
                        count++;
                    }
                    if(count == k[i])
                        break;
                }   
                System.out.println(sum);
            }
        }
    }
}