#include <bits/stdc++.h>
using namespace std;
long long n, q;
long long a[201010], b[201010];
int main() {
  cin >> n >> q;
  n *= 2;
  for (long long i = (long long)(0); i < (long long)(n); i++) cin >> a[i];
  for (long long i = (long long)(0); i < (long long)(n); i++) cin >> b[i];
  vector<long long> v;
  long long score = 0;
  if (q != 1) return 0;
  long long p, pa, push_back;
  cin >> p >> pa >> push_back;
  p--;
  a[p] = pa;
  b[p] = push_back;
  for (long long i = (long long)(1); i < (long long)(n - 1); i++) {
    v.push_back(b[i] - a[i]);
  }
  sort((v).begin(), (v).end(), greater<long long>());
  for (long long i = (long long)(0); i < (long long)(n); i++) score += a[i];
  for (long long i = (long long)(0); i < (long long)(v.size() - 1); i++) {
    if (v[i] + v[i + 1] > 0) {
      score += v[i] + v[i + 1];
      i++;
    } else
      break;
  }
  cout << score << endl;
  return 0;
}
