1
/**
2
******************************************************************************
3
* @file Function
4
* @author   WildRage
5
* @version v 1.0
6
* @date 2017-8-10 10:57:28
7
* @brief
8
******************************************************************************
9
*/
10
#include <cstdio>
11
#include <cstring>
12
#include <algorithm>
13
using namespace std;
14
#define LL long long
15
LL a[1005], b[1005], c[1005];
16
LL Max[200005];
17
int fix = 100001;
18
int main()
19
{
20
    memset(Max, 0x80, sizeof(Max));
21
    int n, q;
22
    scanf("%d%d", &n, &q);
23
    for (int i = 1; i <= n; i++)
24
    {
25
        scanf("%lld%lld%lld", &a[i], &b[i], &c[i]);
26
    }
27
    LL u;
28
    for (int i = -100000; i <= 100000; i++)
29
    {
30
        for (int j = 1; j <= n; j++)
31
        {
32
            Max[i + fix] = max(Max[i + fix], a[j] * i * i + b[j] * i + c[j]);
33
        }
34
    }
35
    while (q--)
36
    {
37
        scanf("%lld", &u);
38
        printf("%lld\n", Max[u + fix]);
39
    }
40
    return 0;
41
}