Go: ///
// File:  2502.go
// Author: ymiyamoto
//
// Created on Sat Mar 24 00:44:45 2018
//
package main

import (
	"fmt"
)

var n, m int

type phrase struct {
	s, l, p int
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func main() {
	fmt.Scan(&n)

	phrases := make([]phrase, n)
	max_count := 0
	for i := 0; i < n; i++ {
		fmt.Scan(&phrases[i].s, &phrases[i].l, &phrases[i].p)
		max_count += phrases[i].l
	}

	dp := make([][]int, n+1)
	for i := range dp {
		dp[i] = make([]int, max_count+1)
	}

	for i := range phrases {
		s := phrases[i].s
		l := phrases[i].l
		p := phrases[i].p
		for j := range dp[i] {
			for k := s; k <= l; k++ {
				if 0 <= j-k {
					dp[i+1][j] = max(dp[i+1][j], max(dp[i][j], dp[i+1][j-k]+p))
				} else {
					dp[i+1][j] = max(dp[i+1][j], dp[i][j])
				}
			}
		}
	}

	fmt.Scan(&m)
	var invalid bool
	var points []int
	for i := 0; i < m; i++ {
		var m int
		fmt.Scan(&m)
		if dp[n][m] == 0 {
			invalid = true
		}
		points = append(points, dp[n][m])
	}

	if invalid {
		fmt.Println(-1)
	} else {
		for _, p := range points {
			fmt.Println(p)
		}
	}
}

C++: #pragma GCC optimize ("O3")

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <string>
using namespace std;

using QWORD  = uint64_t;
using SQWORD = int64_t;
using DWORD  = uint32_t;
using SDWORD = int32_t;
using WORD   = uint16_t;
using SWORD  = int16_t;
using BYTE   = uint8_t;
using SBYTE  = int8_t;
using DOUBLE = double;
using FLOAT  = float;

#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)

#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)

#define MAX_QWORD  (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD  (0xFFFFFFFF)
#define MAX_WORD   (0xFFFF)
#define MAX_BYTE   (0xFF)


#define ArrayLength(a)  (sizeof(a) / sizeof(a[0]))

static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }

#define BYTE_BITS   (8)
#define WORD_BITS   (16)
#define DWORD_BITS  (32)
#define QWORD_BITS  (64)

using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)

static inline void inputString(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}


static inline SQWORD inputSQWORD(void)
{
    SQWORD sqNumber = 0;
    SQWORD sqMultiplier = 1;
    M_BOOL bRead = M_FALSE;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                sqMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            sqNumber *= 10LL;
            sqNumber += (SQWORD)(c - '0');
            bRead = M_TRUE;
        } else {
            if (bRead) {
                return sqNumber * sqMultiplier;
            }
        }
    }
}


static inline SDWORD inputSDWORD(void)
{
    SDWORD lNumber = 0;
    SDWORD lMultiplier = 1;
    M_BOOL bRead = M_FALSE;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                lMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            lNumber *= 10;
            lNumber += (c - '0');
            bRead = M_TRUE;
        } else {
            if (bRead) {
                return lNumber * lMultiplier;
            }
        }
    }
}

static inline DOUBLE inputFP(void)
{
    DOUBLE dInt = 0.0;
    DOUBLE dFrac = 0.0;
    DOUBLE dMultiplier = 1.0;
    DWORD dwFpCnt = 0;
    DOUBLE *pdCur = &dInt;
    M_BOOL bRead = M_FALSE;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                dMultiplier = -1;
            }
        }
        if ('.' == c) {
            pdCur = &dFrac;
        } else if (('0' <= c) && (c <= '9')) {
            (*pdCur) *= 10;
            (*pdCur) += (DOUBLE)(c - '0');
            bRead = M_TRUE;
            if (pdCur == &dFrac) {
                dwFpCnt++;
            }
        } else {
            if (bRead) {
                return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));
            }
        }
    }
}

struct PHRASE {
    SDWORD lLower;
    SDWORD lUpper;
    SDWORD lPoint;
};

#define MAX_MUSIC_LEN   (393)
#define MAX_LOOP        (MAX_MUSIC_LEN)
#define MAX_PNT         (393)
static SDWORD getDpTbl(
    const vector<SDWORD> &vlPnts, 
    SDWORD lMinLen,
    vector<SDWORD> &vDpTbl)
{

    /* dp:長さ i を実現する最大の得点 */
    SDWORD lMaxLoop = (MAX_MUSIC_LEN + lMinLen - 1) / lMinLen;
    for (SDWORD lLoopIdx = 0; lLoopIdx < lMaxLoop; lLoopIdx++) {
        for (SDWORD lDpTblIdx = vDpTbl.size(); 0 <= lDpTblIdx; lDpTblIdx--) {
            SDWORD lMaxPnt = 0;
            for (SDWORD lPrevDpIdx = 0; lPrevDpIdx < lDpTblIdx; lPrevDpIdx++) {
                SDWORD lPnt = vDpTbl[lPrevDpIdx] + vlPnts[lDpTblIdx - lPrevDpIdx];
                lMaxPnt = max(lMaxPnt, lPnt);
            }
            vDpTbl[lDpTblIdx] = lMaxPnt;
        }
    }
    return 0;
}


#define MAX_PHRASE_LEN  (393)
int main()
{
    SDWORD lNumPhrase = inputSDWORD();
    vector<PHRASE>     vPhrases;
    for (SDWORD lIdx = 0; lIdx < lNumPhrase; lIdx++) {
        PHRASE stPhraseOne;
        stPhraseOne.lLower = inputSDWORD();
        stPhraseOne.lUpper = inputSDWORD();
        stPhraseOne.lPoint = inputSDWORD();

        vPhrases.emplace_back(stPhraseOne);
    }
//    printf("A\n");

    /* 長さに対する最大のポイントを計算する */
    vector<SDWORD> vlPnts(MAX_PHRASE_LEN + 1, 0);
    for (auto phrase: vPhrases) {
        for (SDWORD lLen = phrase.lLower; lLen <= phrase.lUpper; lLen++) {
            vlPnts[lLen] = max(vlPnts[lLen], phrase.lPoint);
        }
    }
//    printf("B\n");

    SDWORD lMinLen = MAX_MUSIC_LEN;
    for (auto phrase: vPhrases) {
        lMinLen = min(lMinLen, phrase.lLower);
    }

    vector<SDWORD> vDpTbl(MAX_MUSIC_LEN, 0);
    getDpTbl(vlPnts, lMinLen, vDpTbl);

    SDWORD lNumMusic = inputSDWORD();
    vector<SDWORD> vAns;
    for (SDWORD lMusicIdx = 0; lMusicIdx < lNumMusic; lMusicIdx++) {
        SDWORD lMusicLen = inputSDWORD();

        SDWORD lPnt = vDpTbl[lMusicLen];
        vAns.emplace_back(lPnt);

        if (0 == lPnt) {
            printf("-1\n");
            return 0;
        }
    }
    for (auto pnt:vAns) {
        printf("%d\n", pnt);
    }

    return 0;
}