/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(ll i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(ll i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif



struct Page
{
	ll l, r;
	set<ll> want;
	set<ll> has;
	ll answ;
	
	ll plain(const set<ll>& W, const set<ll>& H)
	{
		ll res =0;
		for(auto el: W)
		{
			if(H.find(el) == H.end())
				++res;
		}
		for(auto el: H)
		{
			if(W.find(el) == W.end())
				++res;
		}
		return res;
	}
	
	ll comp_answ()
	{
		ll res =1e16;
		// select
		{
			set<ll> H;
			FOR(i,l,r+1)H.insert(i);
			res=min(res,1+plain(want,H));
		}
		// deselect
		{
			set<ll> H;
			res=min(res,1+plain(want,H));
		}
		// none
		res = min(res, plain(want,has));
		return answ=res;
	}
};


int solve()
{
	ll n,m,s,p,q;
	if(!(cin>>n>>m>>s>>p>>q))return 1;
	--s;
	vector<int> a;
	vector<int> b;
	a=vector<int>(p); // preselected
	b=vector<int>(q); // I want
	FOR(i,0,p)cin>>a[i];
	FOR(i,0,q)cin>>b[i];
	vector<Page> pages;
	FOR(i,0,n+4)
	{
		Page pg;
		pg.l = i*m+1, pg.r=(i+1)*m;
		FOR(j,0,p)
			if(a[j]>=pg.l && a[j] <= pg.r)
				pg.has.insert(a[j]);

		FOR(j,0,q)
			if(b[j]>=pg.l && b[j] <= pg.r)
				pg.want.insert(b[j]);

		if(pg.r >= n)
		{
			pg.r=n;
		}
		pg.comp_answ();

		//cout<<pg.answ<<' ';
		pages.pb(move(pg));
		if(pg.r == n) break;
	}
	ll L = 0;
	while(L < sz(pages) && pages[L].answ==0)++L;
	ll R = sz(pages)-1;
	while(R >= 0 && pages[R].answ==0)--R;
	ll res=0;
	for(auto& pg: pages)
		res += pg.answ;
	if(res==0)
	{
		cout<<res<<'\n';
		return 0;
	}
	if(s >= L && s <= R)
	{
		ll r1 = 2*(s-L) + R-s;
		ll r2 = 2*(R-s) + s-L;
		res += min(r1, r2);
	}
	else
	{
		res += max(R-s, s-L);
	}
	
	cout<<res<<'\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}