#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

#define ull unsigned long long
const int P=131;

inline ull get(array<int,5>a){
	ull ans=0;
	ans+=a[0]*P*P*P*P+a[1]*P*P*P+a[2]*P*P+a[3]*P+a[4];
	return ans;
}

int main() {
    int N,K;
    cin >> N >> K;
    vector<vector<vector<vector<i64>>>> dp(2,vector<vector<vector<i64>>>(2,vector<vector<i64>>(N+1,vector<i64>(K+1))));
    vector a(2,vector<i64>(N+1));
    for ( int i = 0 ; i < 2 ; i++ ) {
        for ( int j = 1 ; j <= N ; j++ ) {
            cin >> a[i][j];
        }
    }
    sort(a[0].begin(),a[0].end());
    sort(a[1].begin(),a[1].end());
    for ( int i = 0 ; i < 2 ; i++ ) {
        for ( int j = 1 ; j <= N ; j++ ) {
            for ( int k = 1 ; k <= K ; k++ ) {
                dp[i][0][j][k] = ((j >= 2)?dp[i][0][j-2][k]:0)+a[i][j-1]-( (j-1-2*k >= 0) ? a[i][j-1-2*k]:0 ); 
                dp[i][1][j][k] = ((j >= 2)?dp[i][1][j-2][k]:0)+a[i][j]-( (j-2*k >= 0) ? a[i][j-2*k]:0 );
            }
        }
    }
    unordered_map<ull,i64>mp;
    unordered_map<ull,i64>vis;
    auto dfs = [&](auto&dfs,int A,int B,int kA,int kB,int cur)->i64{
        if ( B == 0 ) {
            int t = cur==0;
            return dp[0][t][A][kA];
        }
        if ( A == 0 ) {
            int t = cur==1;
            return -dp[1][t][B][kB];
        }
        if ( kB == 0 ) {
            int t = cur==0;
            return dp[0][t][A][kA];
        }
        if ( kA == 0 ) {
            int t = cur==1;
            return -dp[1][t][B][kB];
        }
        // return 0;
        array<int,5>U = {A,B,kA,kB,cur};
        if ( vis[get(U)] ) {
            return mp[get(U)];
        } 
        i64 res;
        if ( cur == 0 ) {
            res = -1e18;
            if ( A >= 1 )  res = max(dfs(dfs,A-1,B,kA-1,kB,cur^1)+a[0][A],res);
            if ( B >= 1 )  res = max(dfs(dfs,A,B-1,kA,kB,cur^1),res);
        } else {
            res = 1e18;
            if ( B >= 1 )  res = min(dfs(dfs,A,B-1,kA,kB-1,cur^1)-a[1][B],res);
            if ( A >= 1 )  res = min(dfs(dfs,A-1,B,kA,kB,cur^1),res);
        }
        mp[get({A,B,kA,kB,cur})] = res;
        vis[get({A,B,kA,kB,cur})] = 1;
        // cout << A << ' ' << B << ' ' << kA << ' ' << kB << ' ' << ' ' << cur << ' ' << res << '\n';
        return res;
    };
    // cout << 1 << '\n';
    cout << dfs(dfs,N,N,K,K,0) << '\n';
}