#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ld = double;
const ll mod = 1000000007;
ll gcd(ll a, ll b) {
  if (a == 0 or b == 0) return a + b;
  return gcd(b, a % b);
}
ll sum(ll a, ll b) {
  a += b;
  a %= mod;
  return a;
}
ll sub(ll a, ll b) {
  a += mod - b;
  a %= mod;
  return a;
}
inline ll mul(ll a, ll b) {
  if (a * b < mod) return a * b;
  return a * b % mod;
}
inline ll pew(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = mul(res, a);
    a = mul(a, a);
    b /= 2;
  }
  return res;
}
int parent[600001];
int rnk[600001];
void make_set(int v) {
  parent[v] = v;
  rnk[v] = 0;
}
int find_set(int v) {
  if (v == parent[v]) return v;
  return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
  a = find_set(a);
  b = find_set(b);
  if (a != b) {
    if (rnk[a] < rnk[b]) swap(a, b);
    parent[b] = a;
    if (rnk[a] == rnk[b]) ++rnk[a];
  }
}
const ll M = 100;
int main() {
  ios_base::sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  vector<pair<ll, ll>> h(n), w(n);
  for (int i = 0; i < n; i++) {
    cin >> w[i].first;
    w[i].second = i;
  }
  sort(w.begin(), w.end());
  for (int i = 0; i < n; i++) {
    cin >> h[i].first;
    h[i].second = i;
  }
  sort(h.begin(), h.end());
  vector<ll> pos(n), p(n);
  for (int i = 0; i < n; i++) {
    pos[w[i].second] = i;
  }
  for (int i = 0; i < n; i++) {
    p[pos[h[i].second]] = i;
  }
  ll S = n / M;
  if (n % M != 0) S++;
  vector<ll> msk = {3, 5, 9, 6, 10, 12};
  vector<vector<ll>> nxt(6), a(6);
  for (int i = 0; i < 6; i++) {
    int cur = msk[i];
    vector<int> b(5);
    int x = 1;
    for (int j = 0; j < 4; j++) {
      if (cur & (1 << j)) {
        b[3 - j] = 1;
        x += (1 << (j + 1));
      }
    }
    b[4] = 1;
    for (int j = 0; j < 5; j++) {
      if (b[j] == 0) continue;
      int v = x - (1 << (4 - j));
      if (v < 16) {
        for (int g = 0; g < 6; g++) {
          if (msk[g] == v) nxt[i].push_back(g);
        }
        a[i].push_back(j - 2);
      }
    }
  }
  vector<ll> H(n), W(n);
  for (int i = 0; i < n; i++) {
    W[i] = w[i].first;
    H[i] = h[i].first;
  }
  ll INF = 1000000000LL * 1000000000LL;
  vector<vector<vector<ll>>> dp(36,
                                vector<vector<ll>>(S, vector<ll>(M + 1, -INF)));
  for (int k = 0; k < S; k++) {
    for (int i = 0; i < 6; i++) {
      dp[i * 7][k][0] = 0;
    }
    for (int st = 0; st < 6; st++)
      for (int i = 0, z = k * M; i < M and z < n; i++, z++) {
        for (int j = 0; j < 6; j++) {
          for (int s = 0; s < nxt[j].size(); s++) {
            if (a[j][s] + z < 0) continue;
            if (a[j][s] + z >= n) continue;
            if (a[j][s] + z == p[z]) continue;
            dp[st + nxt[j][s] * 6][k][i + 1] =
                max(dp[st + nxt[j][s] * 6][k][i + 1],
                    dp[st + j * 6][k][i] + W[z] * H[a[j][s] + z]);
          }
        }
      }
    if (k == S - 1) {
      for (int i = 0; i < 36; i++) {
        dp[i][k][M] = dp[i][k][n - k * M];
      }
    }
  }
  while (q--) {
    ll A, B;
    cin >> A >> B;
    A--, B--;
    A = pos[A];
    B = pos[B];
    swap(p[A], p[B]);
    ll k = A / M;
    for (int i = 0; i < 36; i++) {
      for (int j = 0; j <= M; j++) {
        dp[i][k][j] = -INF;
      }
    }
    for (int i = 0; i < 6; i++) {
      dp[i * 7][k][0] = 0;
    }
    for (int st = 0; st < 6; st++) {
      for (ll i = 0, z = k * M; i < M and z < n; i++, z++) {
        for (int j = 0; j < 6; j++) {
          for (int s = 0; s < nxt[j].size(); s++) {
            if (a[j][s] + z < 0) continue;
            if (a[j][s] + z >= n) continue;
            if (a[j][s] + z == p[z]) continue;
            dp[st + nxt[j][s] * 6][k][i + 1] =
                max(dp[st + nxt[j][s] * 6][k][i + 1],
                    dp[st + j * 6][k][i] + W[z] * H[a[j][s] + z]);
          }
        }
      }
    }
    if (k == S - 1) {
      for (int i = 0; i < 36; i++) {
        dp[i][k][M] = dp[i][k][n - k * M];
      }
    }
    k = B / M;
    for (int i = 0; i < 36; i++) {
      for (int j = 0; j <= M; j++) {
        dp[i][k][j] = -INF;
      }
    }
    for (int i = 0; i < 6; i++) {
      dp[i * 7][k][0] = 0;
    }
    for (int st = 0; st < 6; st++) {
      for (ll i = 0, z = k * M; i < M and z < n; i++, z++) {
        for (int j = 0; j < 6; j++) {
          for (int s = 0; s < nxt[j].size(); s++) {
            if (a[j][s] + z < 0) continue;
            if (a[j][s] + z >= n) continue;
            if (a[j][s] + z == p[z]) continue;
            dp[st + nxt[j][s] * 6][k][i + 1] =
                max(dp[st + nxt[j][s] * 6][k][i + 1],
                    dp[st + j * 6][k][i] + W[z] * H[a[j][s] + z]);
          }
        }
      }
    }
    if (k == S - 1) {
      for (int i = 0; i < 36; i++) {
        dp[i][k][M] = dp[i][k][n - k * M];
      }
    }
    vector<ll> cur(6, -INF);
    cur[0] = 0;
    for (int i = 0; i < S; i++) {
      vector<ll> lul(6, -INF);
      for (int prv = 0; prv < 6; prv++) {
        for (int x = 0; x < 6; x++) {
          lul[x] = max(lul[x], cur[prv] + dp[prv + x * 6][i][M]);
        }
      }
      cur = lul;
    }
    cout << cur[0] << "\n";
  }
}
