#include <bits/stdc++.h>
const long long MXN = 1e5 + 1;
const double eps = 1e-10;
const double pi = acos(-1.0);
const long long OO = 1e18 + 1;
const int MNN = 1e5 + 1;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
using namespace std;
long long n, q, cost[MXN], color[MXN], a, b, dp[MXN], t[MXN * 4], mx[2];
bool used[MXN];
void upd(long long cur) {
  if (dp[cur] > dp[mx[0]]) {
    mx[1] = mx[0];
    mx[0] = cur;
    return;
  }
  if (dp[cur] > dp[mx[1]] && cur != mx[0]) {
    mx[1] = cur;
    return;
  }
}
int main() {
  ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
  ;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> cost[i];
  }
  for (int i = 1; i <= n; i++) {
    cin >> color[i];
  }
  for (int i = 1; i <= q; i++) {
    cin >> a >> b;
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
      dp[i] = -INF;
      used[i] = 0;
      mx[0] = 0;
      mx[1] = 0;
    }
    for (int i = 1; i <= n; i++) {
      if (used[color[i]] == 1)
        dp[color[i]] = max(dp[color[i]] + cost[i] * a, dp[color[i]]);
      long long mxget = 0;
      if (mx[0] == color[i]) {
        mxget = mx[1];
      } else {
        mxget = mx[0];
      }
      dp[color[i]] = max(dp[mxget] + cost[i] * b, dp[color[i]]);
      used[color[i]] = 1;
      upd(color[i]);
      ans = max(dp[color[i]], ans);
    }
    cout << ans << '\n';
  }
  return 0;
}
