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

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define int ll

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;


int solve()
{
	int n, m, s, p, q;
	if (!(cin >> n >> m >> s >> p >> q))
		return 1;
	
	s--;
	vector<int> pre(p), need(q);
	FOR (i, 0, p)
	{
		cin >> pre[i];
		pre[i]--;
	}
	FOR (i, 0, q)
	{
		cin >> need[i];
		need[i]--;
	}
	
	int ans = 1e9;
	int pages = (n + m - 1) / m;
	//sort(all(pre));
	//sort(all(need));
	set<int> preS(all(pre));
	set<int> needS(all(need));
	vector<int> forPage(pages);
	vector<int> was;
	//cerr << "pages = " << pages << '\n';
	FOR (i, 0, pages)
	{
		int vyb = 0, pot = 0, sp = 0;
		for (int j = i * m; j < i * m + m && j < n; j++)
		{
			if (preS.count(j))
				vyb++;
			if (needS.count(j))
				pot++;
			if (preS.count(j) && needS.count(j))
				sp++;
		}
		//cerr << "i = " << i << " vyb = " << vyb << " pot = " << pot << " sp = " << sp << '\n';
		int cur = vyb + pot - 2 * sp;
		cur = min(cur, 1 + pot);
		if (i != pages - 1 || n % m == 0)
			cur = min(cur, 1 + m - pot);
		else
			cur = min(cur, 1 + (n % m) - pot);
		forPage[i] = cur;
		if (cur != 0)
			was.pb(i);
	}
	
	int totPages = 0;
	FOR (i, 0, sz(was))
		totPages += forPage[was[i]];
	
	if (was.empty())
	{
		cout << "0\n";
		return 0;
	}
	
	//FOR (i, 0, sz(was))
	//{
		//int j = was[i];
		//cerr << "j = " << j << " forPage = " << forPage[j] << '\n';
	//}
	
	int fir = min(was[0], s);
	int las = max(was.back(), s);
	ans = min(ans, totPages + 2 * (s - fir) + las - s);
	ans = min(ans, totPages + 2 * (las - s) + s - fir);
	cout << ans << '\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
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}