#include <cstdio>
typedef long long ll;

const int MAXN = 5e5 + 10;

int n, k;
int A[MAXN], B[MAXN];
int visA[MAXN], visB[MAXN];
ll ans = 0x7fffffffffffffff;

void dfs(int pos, ll now) {
  if (now >= ans) return ;
  if (pos > k) {
    ans = now;
    return ;
  }
  for (int i = 1; i <= n; ++i) if (!visA[i]) {
    for (int j = i; j <= n; ++j) if (!visB[j]) {
      visA[i] = visB[j] = 1;
      dfs(pos + 1, now + A[i] + B[j]);
      visA[i] = visB[j] = 0;
    }
  }
}

int main() {
  freopen("Mujica.in", "r", stdin);
  freopen("Mujica.out", "w", stdout);
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &A[i]);
  for (int i = 1; i <= n; ++i) scanf("%d", &B[i]);
  
  dfs(1, 0);
  
  printf("%lld\n", ans);
  return 0;
}