#include<bits/stdc++.h>
#define ll long long
#define N 1000001
using namespace std;
ll n,m,a[N],b[N],ans=1e9;
void dfs(int dep,ll minx,ll maxx,int num){
    if(dep==n){
        ans=min(ans,maxx-minx);
        return ;
    }
    dfs(dep+1,min(minx,a[dep+1]),max(maxx,a[dep+1]),num);
    if(num<m) dfs(dep+1,min(minx,b[dep+1]),max(maxx,b[dep+1]),num+1);
    return ;
}
int main(){
    freopen("card.in","r",stdin);
    freopen("card.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    dfs(0,1e9,0,0);
    cout<<ans<<endl;
    return 0;
}