Problem: There are n balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the i-th ball is ci and the value of the i-th ball is vi.

Squirrel Liss chooses some balls and makes a new sequence without changing the relative order of the balls. She wants to maximize the value of this sequence.

The value of the sequence is defined as the sum of following values for each ball (where a and b are given constants):

  * If the ball is not in the beginning of the sequence and the color of the ball is same as previous ball's color, add (the value of the ball)  ×  a. 
  * Otherwise, add (the value of the ball)  ×  b. 



You are given q queries. Each query contains two integers ai and bi. For each query find the maximal value of the sequence she can make when a = ai and b = bi.

Note that the new sequence can be empty, and the value of an empty sequence is defined as zero.

Input

The first line contains two integers n and q (1 ≤ n ≤ 105; 1 ≤ q ≤ 500). The second line contains n integers: v1, v2, ..., vn (|vi| ≤ 105). The third line contains n integers: c1, c2, ..., cn (1 ≤ ci ≤ n).

The following q lines contain the values of the constants a and b for queries. The i-th of these lines contains two integers ai and bi (|ai|, |bi| ≤ 105).

In each line integers are separated by single spaces.

Output

For each query, output a line containing an integer — the answer to the query. The i-th line contains the answer to the i-th query in the input order.

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples

Input

6 3
1 -2 3 4 0 -1
1 2 1 2 1 1
5 1
-2 1
1 0


Output

20
9
4


Input

4 1
-3 6 -1 2
1 2 3 1
1 -1


Output

5

Note

In the first example, to achieve the maximal value:

  * In the first query, you should select 1st, 3rd, and 4th ball. 
  * In the second query, you should select 3rd, 4th, 5th and 6th ball. 
  * In the third query, you should select 2nd and 4th ball. 



Note that there may be other ways to achieve the maximal value.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T, class V, int MAX_FREE_FACTOR = (1 << 20), int INIT_m = 3>
struct hash_map {
  int size, m, M;
  T* bucket;
  V* values;
  unsigned long long a;
  unsigned long long b;
  T MAX, MIN;
  int min_filled;
  void init() {
    a = uniform_int_distribution<unsigned long long>()(rng);
    if (a % 2 == 0) a++;
    b = uniform_int_distribution<unsigned long long>()(rng);
    m = INIT_m;
    M = 1 << m;
    bucket = new T[M];
    values = new V[M];
    size = 0;
    MAX = numeric_limits<T>::max();
    MIN = numeric_limits<T>::min();
    min_filled = 0;
    fill(bucket, bucket + M, MIN);
    fill(values, values + M, numeric_limits<V>::min());
  }
  hash_map() { init(); }
  int h(T x) { return (((unsigned long long)x) * a + b) >> (64 - m); }
  void rehash(int new_m) {
    int oldM = M;
    T* bucket_copy = new T[M];
    V* values_copy = new V[M];
    copy(bucket, bucket + M, bucket_copy);
    copy(values, values + M, values_copy);
    delete[] bucket;
    delete[] values;
    M = (1 << new_m);
    m = new_m;
    min_filled = M / MAX_FREE_FACTOR;
    bucket = new T[M];
    values = new V[M];
    fill(bucket, bucket + M, MIN);
    fill(values, values + M, numeric_limits<V>::min());
    size = 0;
    for (int i = 0; i < oldM; i++) {
      T v = bucket_copy[i];
      if (v != MIN && v != MAX) (*this)[v] = values_copy[i];
    }
    delete[] bucket_copy;
    delete[] values_copy;
  }
  V& operator[](T x) {
    if (2 * size >= M) {
      rehash(m + 1);
    }
    int pos = h(x);
    while (bucket[pos] != MIN) {
      if (bucket[pos] == x) {
        return values[pos];
      }
      pos = (pos + 1) & (M - 1);
    }
    bucket[pos] = x;
    values[pos] = numeric_limits<V>::min();
    size++;
    return values[pos];
  }
  bool erase(T x) {
    if (size < min_filled && m > INIT_m + 5) {
      rehash(m - 1);
    }
    int pos = h(x);
    while (bucket[pos] != MIN) {
      if (bucket[pos] == x) {
        bucket[pos] = MAX;
        values[pos] = numeric_limits<V>::min();
        size--;
        return true;
      }
      pos = (pos + 1) & (M - 1);
    }
    return false;
  }
  void clear() {
    delete[] bucket;
    delete[] values;
    init();
  }
  ~hash_map() {
    delete[] bucket;
    delete[] values;
  }
};
const long long INF = 1e15 + 21;
const long long MAXN = 1e5 + 5;
long long N, Q;
long long V[MAXN];
long long C[MAXN];
long long dp[MAXN];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> Q;
  for (long long i = 0; i < N; i++) {
    cin >> V[i];
  }
  for (long long i = 0; i < N; i++) {
    cin >> C[i];
  }
  hash_map<int, long long> curMax;
  for (long long i = 0; i < Q; i++) {
    for (int i = 0; i < N; i++) {
      curMax[C[i]] = -INF;
    }
    long long a, b;
    cin >> a >> b;
    fill(dp, dp + N, -1);
    pair<long long, long long> mx1 = {0, 1e5 + 5};
    pair<long long, long long> mx2 = {0, 1e5 + 4};
    for (long long j = 0; j < N; j++) {
      if (mx1.second == C[j]) {
        dp[j] = mx2.first + b * V[j];
      } else {
        dp[j] = mx1.first + b * V[j];
      }
      dp[j] = max(dp[j], curMax[C[j]] + a * V[j]);
      if (dp[j] > mx1.first) {
        if (C[j] == mx1.second) {
          mx1 = {dp[j], C[j]};
        } else {
          mx2 = {mx1.first, mx1.second};
          mx1 = {dp[j], C[j]};
        }
      } else if (dp[j] > mx2.first) {
        if (C[j] == mx1.second) {
          continue;
        } else {
          mx2 = {dp[j], C[j]};
        }
      }
      curMax[C[j]] = max(curMax[C[j]], dp[j]);
    }
    cout << mx1.first << endl;
  }
}