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;
long long g[100007];
long long m[100007];
struct Node {
  long long c, v;
} a[100007];
struct Tree {
  int l, r, ls, rs;
  long long max;
} tree[100007 << 1];
int tot, f[100007 << 1], p[100007];
void Up(int t) {
  tree[t].max = 0;
  if (tree[t].ls)
    tree[t].max =
        ((tree[t].max) > (tree[tree[t].ls].max) ? (tree[t].max)
                                                : (tree[tree[t].ls].max));
  if (tree[t].rs)
    tree[t].max =
        ((tree[t].max) > (tree[tree[t].rs].max) ? (tree[t].max)
                                                : (tree[tree[t].rs].max));
}
void buildtree(int l, int r) {
  int cnt = ++tot;
  tree[cnt].l = l, tree[cnt].r = r;
  tree[cnt].ls = tree[cnt].rs = 0;
  if (l == r) {
    p[l] = cnt;
    m[l] = -1e+11;
    tree[cnt].max = -1e+11;
    return;
  }
  int mid = (l + r) >> 1;
  if (l <= mid) {
    f[1 + tot] = cnt;
    tree[cnt].ls = 1 + tot;
    buildtree(l, mid);
  }
  ++mid;
  if (mid <= r) {
    f[1 + tot] = cnt;
    tree[cnt].rs = 1 + tot;
    buildtree(mid, r);
  }
  Up(cnt);
}
long long queryMax(int t, int l, int r) {
  if (t <= 0 || l > r) return 0;
  if (l == r) return m[l];
  if (l == tree[t].l && r == tree[t].r) return tree[t].max;
  int mid = (tree[t].l + tree[t].r) >> 1;
  if (r <= mid) return queryMax(tree[t].ls, l, r);
  if (l > mid) return queryMax(tree[t].rs, l, r);
  return ((queryMax(tree[t].ls, l, mid)) > (queryMax(tree[t].rs, mid + 1, r))
              ? (queryMax(tree[t].ls, l, mid))
              : (queryMax(tree[t].rs, mid + 1, r)));
}
void update(int t, long long value) {
  m[t] = value;
  t = p[t];
  tree[t].max = value;
  while (f[t]) {
    t = f[t];
    Up(t);
  }
}
inline int sign(long long x) {
  if (x == 0) return 0;
  if (x > 0) return 1;
  return -1;
}
int main() {
  int n, q;
  int i;
  long long x, y, ans, tmp;
  int c1, c2;
  long long max1, max2;
  scanf("%d%d", &n, &q);
  for (i = 0; i < n; ++i) scanf("%I64d", &a[i].v);
  for (i = 0; i < n; ++i) scanf("%I64d", &a[i].c);
  while (q--) {
    for (i = 0; i < n; ++i) m[a[i].c] = -1e+11;
    scanf("%I64d%I64d", &y, &x);
    ans = 0;
    c1 = c2 = 0;
    max1 = max2 = -1e+11;
    for (i = 0; i < n; ++i) {
      g[i] = -1e+11;
      tmp = (a[i].c != c1) ? max1 : max2;
      tmp = ((tmp) > (0) ? (tmp) : (0));
      g[i] = ((g[i]) > (tmp + x * a[i].v) ? (g[i]) : (tmp + x * a[i].v));
      g[i] = ((g[i]) > (m[a[i].c] + y * a[i].v) ? (g[i])
                                                : (m[a[i].c] + y * a[i].v));
      ans = ((ans) > (g[i]) ? (ans) : (g[i]));
      m[a[i].c] = ((m[a[i].c]) > (g[i]) ? (m[a[i].c]) : (g[i]));
      if (g[i] > max1) {
        if (a[i].c == c1) {
          max1 = g[i];
        } else {
          max2 = max1, c2 = c1;
          max1 = g[i], c1 = a[i].c;
        }
      } else if (g[i] > max2) {
        if (a[i].c == c2) {
          max2 = g[i];
        } else {
          if (a[i].c != c1) {
            max2 = g[i], c2 = a[i].c;
          }
        }
      }
    }
    printf("%I64d\n", ans);
  }
  return 0;
}