codeforces796E Exam Cheating

Zane and Zane's crush have just decided to date! However, the girl is having a problem with her Physics final exam, and needs your help.

There are n questions, numbered from 1 to n. Question i comes before question i + 1 (1 ≤ i < n). Each of the questions cannot be guessed on, due to the huge penalty for wrong answers. The girl luckily sits in the middle of two geniuses, so she is going to cheat.

However, the geniuses have limitations. Each of them may or may not know the answers to some questions. Anyway, it is safe to assume that the answers on their answer sheets are absolutely correct.

To make sure she will not get caught by the proctor, the girl will glance at most p times, each time looking at no more than kconsecutive questions on one of the two geniuses' answer sheet. When the girl looks at some question on an answer sheet, she copies the answer to that question if it is on that answer sheet, or does nothing otherwise.

Help the girl find the maximum number of questions she can get correct.

Input

The first line contains three integers n, p, and k (1 ≤ n, p ≤ 1, 000, 1 ≤ k ≤ min(n, 50)) — the number of questions, the maximum number of times the girl can glance, and the maximum number of consecutive questions that can be looked at in one time glancing, respectively.

The second line starts with one integer r (0 ≤ r ≤ n), denoting the number of questions the first genius has answered on his answer sheet. Then follow r integers a1, a2, ..., ar (1 ≤ ai ≤ n) — the answered questions, given in a strictly-increasing order (that is,ai < ai + 1).

The third line starts with one integer s (0 ≤ s ≤ n), denoting the number of questions the second genius has answered on his answer sheet. Then follow s integers b1, b2, ..., bs (1 ≤ bi ≤ n) — the answered questions, given in a strictly-increasing order (that is,bi < bi + 1).

Output

Print one integer — the maximum number of questions the girl can answer correctly.

Examples

input

6 2 3
3 1 3 6
4 1 2 5 6

output

4

input

8 3 3
4 1 3 5 6
5 2 4 6 7 8

output

7

Note

Let (x, l, r) denote the action of looking at all questions i such that l ≤ i ≤ r on the answer sheet of the x-th genius.

In the first sample, the girl could get 4 questions correct by performing sequence of actions (1, 1, 3) and (2, 5, 6).

In the second sample, the girl could perform sequence of actions (1, 3, 5), (2, 2, 4), and (2, 6, 8) to get 7 questions correct.

有一个人要考试作弊，假设他旁边两个人的答案都正确，每人都做了一些题目。

他可以往旁边看p次，每次可以看连续的k道题的答案。问他最多可以做对多少题

我们用f[i][j][x][y]表示前i题看了j次，还可以再连续看第一个人x题，第二个人y题的最大做对数

那么f[i][j][x][y]可以转移到f[i][j][x-1][y-1] f[i][j+1][k-1][y-1]和f[i][j+1][x-1][k-1]

分别维护一下即可

需要滚动数组

#include<queue>
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;
int f[2][1005][55][55];
int a[1005],b[1005];
int main()
{
	int n,p,k;
	scanf("%d%d%d",&n,&p,&k);
	if(p>2*(n+k-1)/k)
		p=2*(n+k-1)/k;
	int n1,n2,x;
	scanf("%d",&n1);
	int i,j;
	for(i=1;i<=n1;i++)
	{
		scanf("%d",&x);
		a[x]=1;
	}
	scanf("%d",&n2);
	for(i=1;i<=n2;i++)
	{
		scanf("%d",&x);
		b[x]=1;
	}
	int y;
	memset(f,-127/3,sizeof(f));
	f[0][0][0][0]=0;
	int p1=1,p2=0;
	for(i=1;i<=n;i++)
	{
		for(j=0;j<=p;j++)
		{
			for(x=0;x<k;x++)
			{
				for(y=0;y<k;y++)
				{
					if(y!=0)
						f[p1][j+1][k-1][y-1]=max(f[p1][j+1][k-1][y-1],f[p2][j][x][y]+(a[i]||b[i]));
					else
						f[p1][j+1][k-1][0]=max(f[p1][j+1][k-1][0],f[p2][j][x][y]+a[i]);
						
					if(x!=0)
						f[p1][j+1][x-1][k-1]=max(f[p1][j+1][x-1][k-1],f[p2][j][x][y]+(a[i]||b[i]));
					else
						f[p1][j+1][0][k-1]=max(f[p1][j+1][0][k-1],f[p2][j][x][y]+b[i]);
						
					if(x!=0&&y!=0)
						f[p1][j][x-1][y-1]=max(f[p1][j][x-1][y-1],f[p2][j][x][y]+(a[i]||b[i]));
					else if(x!=0)
						f[p1][j][x-1][0]=max(f[p1][j][x-1][0],f[p2][j][x][y]+a[i]);
					else if(y!=0)
						f[p1][j][0][y-1]=max(f[p1][j][0][y-1],f[p2][j][x][y]+b[i]);
					else
						f[p1][j][0][0]=max(f[p1][j][0][0],f[p2][j][x][y]);
				}
			}
		}
		p1=1-p1;
		p2=1-p2;
		for(j=0;j<=p;j++)
			for(x=0;x<k;x++)
				for(y=0;y<k;y++)
					f[p1][j][x][y]=-100000;
	}
	int ans=0;
	for(j=0;j<=p;j++)
		for(x=0;x<k;x++)
			for(y=0;y<k;y++)
				ans=max(ans,f[p2][j][x][y]);
	printf("%d\n",ans);
	return 0;
}