2013 Asia Changsha Regional Contest A

Alice's Print Service

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

Alice is providing print service, while the pricing doesn't seem to be reasonable, so people using her print service found some tricks to save money.

For example, the price when printing less than 100 pages is 20 cents per page, but when printing not less than 100 pages, you just need to pay only 10 cents per page. It's easy to figure out that if you want to print 99 pages, the best choice is to print an extra blank page so that the money you need to pay is 100 × 10 cents instead of 99 × 20 cents.

Now given the description of pricing strategy and some queries, your task is to figure out the best ways to complete those queries in order to save money.

Input

The first line contains an integer T (≈ 10) which is the number of test cases. Then T cases follow.

Each case contains 3 lines. The first line contains two integers n, m (0 < n, m ≤ 10⁵). The second line contains 2n integers s₁, p₁, s₂, p₂, ..., s_n, p_n (0=s₁ < s₂ < ... < s_n ≤ 10⁹, 10⁹ ≥ p₁ ≥ p₂ ≥ ... ≥ p_n ≥ 0). The price when printing no less than s_i but less than s_i+1 pages is p_i cents per page (for i=1..n-1). The price when printing no less than s_n pages is p_n cents per page. The third line containing m integers q₁ .. q_m (0 ≤ q_i ≤ 10⁹) are the queries.

Output

For each query q_i, you should output the minimum amount of money (in cents) to pay if you want to print q_i pages, one output in one line.

Sample Input

1
2 3
0 20 100 10
0 99 100

Sample Output

0
1000
1000

#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <queue>

using namespace std;
#define INF 0x7fffffff
#define mod 1000000007
#define maxm 1001
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i = 0; i < (n); i++)
#define re return
#define fi first
#define se second
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(abs(x))
#define y0 y3487465
//#define y1 y8687969
#define fill(x,y) memset(x,y,sizeof(x))

typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef double D;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef vector<vi> vvi;

template<class T> T abs(T x) { re x > 0 ? x : -x; }

const int maxn = 111505;
int n, m, t, k;
ll x;
//string s;
ll s[maxn], p[maxn];
ll sum[maxn];
int main(){
    scanf("%d", &t);
    while (t--){
        scanf("%d%d", &n, &m);
        for (int i = 0; i < n; i++)
            scanf("%d%d", &s[i], &p[i]);
        sum[n - 1] = s[n - 1] * p[n - 1];
        sum[n] = ((ll) 1 << 62) - 1;
        for (int i = n - 2; i >= 0; i--)sum[i] = min(sum[i + 1], s[i] * p[i]);
        while (m--){
            scanf("%lld", &x);
            int L = upper_bound(s, s + n, x) - s;
            ll ans = ((ll) 1 << 62) - 1;
            ans = min(ans, p[L - 1] * x);
            printf("%lld\n", min(ans, sum[L]));
        }
    }
    return 0;
}