#include <iostream>
#include <queue>
#include <utility>
#include <cmath>
#include <cstdio>
using namespace std;
const int N=1e6+6;
int n,m;
int a[N],b[N];
int ans=0x7f7f7f7f;
void dfs(int t,int x,int mx,int mn){
    if(t==n+1){
        ans=min(ans,mx-mn);
        return;
    } 
    dfs(t+1,x,max(mx,a[t]),min(mn,a[t]));
    if(x>0){
        dfs(t+1,x-1,max(mx,b[t]),min(mn,b[t]));
    }
}
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(1,m,0xc0c0c0c0,0x7f7f7f7f);
	cout<<ans;
	return 0;
}