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 C
{
    public static void main( String[] args )
    {
        Scanner in = new Scanner( System.in );
        int n = in.nextInt(), q = in.nextInt();
        ArrayList<taskse> tsk = new ArrayList<taskse>();
        for ( int i = 0; i < q; i++ )
        {
            int t = in.nextInt(), k = in.nextInt(), d = in.nextInt();
            tsk.add( new taskse( t, k, i ) );
            tsk.add( new taskse( t + d, 0 - k, i ) );
        }
        int[] ss = new int[q];
        Collections.sort( tsk );
        int cur = 0;
        for ( int i = 0; i < 2 * q; i++ )
        {
            taskse curtsk = tsk.get( i );
            if ( ss[curtsk.n] != -1 )
            {
                if ( curtsk.k < 0 )
                    cur += curtsk.k;
                else if ( cur + curtsk.k > n )
                    ss[curtsk.n] = -1;
                else
                {
                    for ( int j = cur + 1; j <= cur + curtsk.k; j++ )
                        ss[curtsk.n] += j;
                    cur += curtsk.k;
                }
            }
        }
        for ( int i = 0; i < q; i++ )
            System.out.println( ss[i] );
        in.close();
        System.exit( 0 );
    }
}

class taskse implements Comparable<taskse>
{
    int t, k, n;

    public taskse( int t, int k, int n )
    {
        this.t = t;
        this.k = k;
        this.n = n;
    }

    public int compareTo( taskse t )
    {
        if ( this.t != t.t )
            return this.t - t.t;
        else
            return this.k - t.k;
    }

    public String toString()
    {
        return t + " " + k + " " + n;
    }
}