#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int nmax = 3e4 + 55;
const int qmax = 1e4 + 5;
pair<int, int> war[nmax];
pair<int, int> hor[nmax];
int loc[nmax];
long long dp[nmax];
int n, q;
void calc(int l, int r, long long &location) {
  for (int j = l; j <= r; ++j) {
    dp[j] = LLONG_MIN / 10;
  }
  dp[l] = 0;
  for (int j = l; j < r; ++j) {
    if (war[j + 1].second != j + 1) {
      dp[j + 1] = max(dp[j + 1],
                      dp[j] + (long long)war[j + 1].first * hor[j + 1].first);
    }
    if (war[j + 1].second != j + 2 && war[j + 2].second != j + 1) {
      dp[j + 2] = max(dp[j + 2],
                      dp[j] + (long long)war[j + 1].first * hor[j + 2].first +
                          (long long)war[j + 2].first * hor[j + 1].first);
    }
    if (war[j + 1].second != j + 3 && war[j + 2].second != j + 1 &&
        war[j + 3].second != j + 2) {
      dp[j + 3] = max(dp[j + 3],
                      dp[j] + (long long)war[j + 1].first * hor[j + 3].first +
                          (long long)war[j + 2].first * hor[j + 1].first +
                          (long long)war[j + 3].first * hor[j + 2].first);
    }
    if (war[j + 1].second != j + 2 && war[j + 2].second != j + 3 &&
        war[j + 3].second != j + 1) {
      dp[j + 3] = max(dp[j + 3],
                      dp[j] + (long long)war[j + 1].first * hor[j + 2].first +
                          (long long)war[j + 2].first * hor[j + 3].first +
                          (long long)war[j + 3].first * hor[j + 1].first);
    }
  }
  location = dp[r];
}
class seg {
 public:
  int len;
  vector<vector<vector<long long> > > arr;
  seg() {
    len = 1 << 15;
    arr.resize(2 * len, vector<vector<long long> >(
                            3, vector<long long>(3, LLONG_MIN / 10)));
  }
  void update(int location) {
    for (location += len; location >>= 1;) {
      for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
          arr[location][i][j] = LLONG_MIN / 10;
          for (int k = 0; k < 3; ++k) {
            arr[location][i][j] =
                max(arr[location][i][j],
                    arr[location << 1][i][k] + arr[location << 1 | 1][k][j]);
          }
        }
      }
    }
  }
  void modif(int location) {
    for (int i = 0; i < 3; ++i) {
      for (int j = 0; j < 3; ++j) {
        if (location - 2 + i >= 0 && j >= i) {
          calc(location - 3 + i, location - 2 + j, arr[location + len][i][j]);
        } else if (j == i - 1) {
          arr[location + len][i][j] = 0;
        } else {
          arr[location + len][i][j] = LLONG_MIN / 10;
        }
      }
    }
    update(location);
  }
  long long querry(int l, int r) {
    vector<vector<long long> > res(3, vector<long long>(3, LLONG_MIN / 10)),
        res2(3, vector<long long>(3, LLONG_MIN / 10));
    res[2][2] = 0;
    vector<int> r_his;
    for (l += len, r += len; l < r; l >>= 1, r >>= 1) {
      if (l & 1) {
        for (int i = 0; i < 3; ++i) {
          for (int j = 0; j < 3; ++j) {
            res2[i][j] = LLONG_MIN / 10;
            for (int k = 0; k < 3; ++k) {
              res2[i][j] = max(res2[i][j], res[i][k] + arr[l][k][j]);
            }
          }
        }
        res = res2;
        ++l;
      }
      if (r & 1) {
        r_his.push_back(--r);
      }
    }
    while (!r_his.empty()) {
      r = r_his.back();
      r_his.pop_back();
      for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 3; ++j) {
          res2[i][j] = LLONG_MIN / 10;
          for (int k = 0; k < 3; ++k) {
            res2[i][j] = max(res2[i][j], res[i][k] + arr[r][k][j]);
          }
        }
      }
      res = res2;
    }
    return res[2][2];
  }
};
int main() {
  seg foo;
  scanf("%d %d", &n, &q);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &war[i].first);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &hor[i].first);
    hor[i].second = i;
  }
  sort(hor + 1, hor + n + 1);
  for (int i = 1; i <= n; ++i) {
    war[hor[i].second].second = i;
  }
  sort(war + 1, war + n + 1);
  for (int i = 1; i <= n; ++i) {
    loc[hor[war[i].second].second] = i;
  }
  for (int i = 1; i <= n; ++i) {
    foo.modif(i);
  }
  for (int i = 0; i < q; ++i) {
    int a, b;
    scanf("%d %d", &a, &b);
    swap(war[loc[a]].second, war[loc[b]].second);
    for (int j = loc[a]; j < loc[a] + 3; ++j) {
      foo.modif(j);
    }
    for (int j = loc[b]; j < loc[b] + 3; ++j) {
      foo.modif(j);
    }
    long long res = 0;
    printf("%lld\n", foo.querry(1, n + 1));
  }
  return 0;
}
