#include <bits/stdc++.h>
using namespace std;
vector<int> v1;
pair<int, int> p1;
long long a[1234567], b[1234567], n;
string s;
long long dp[100009], p, q;
long long pow1(long long x, long long y) {
  if (y == 0) return 1;
  long long temp = pow1(x, y / 2) % 1000000007;
  if (y % 2 == 0)
    return (temp * temp) % 1000000007;
  else
    return (((temp * temp) % 1000000007) * x) % 1000000007;
}
int main() {
  int t;
  int i, j, k, m, l;
  cin >> n >> t;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < n; i++) cin >> b[i];
  while (t--) {
    for (i = 1; i < 100007; i++) dp[i] = -1e17;
    cin >> p >> q;
    int max1 = 0, max2 = 1;
    for (i = 0; i < n; i++) {
      long long ans = 0;
      long long last = dp[b[i]];
      dp[b[i]] = max(dp[b[i]], dp[b[i]] + p * 1ll * a[i]);
      if (max1 == b[i]) {
        dp[b[i]] = max(dp[b[i]], dp[max2] + q * 1ll * a[i]);
        continue;
      } else
        dp[b[i]] = max(dp[b[i]], dp[max1] + q * 1ll * a[i]);
      if (dp[b[i]] > dp[max1]) {
        max2 = max1;
        max1 = b[i];
      } else if (dp[b[i]] >= dp[max2])
        max2 = b[i];
    }
    cout << dp[max1] << "\n";
  }
  return 0;
}
