1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<bitset>
#include<cmath>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll unsigned long long
#define succ(x) (1ll<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 2005
#define nm 400005
using namespace std;
const double pi=acos(-1);
const int inf=1e9+9;
const double eps=1e-8;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
inline void reduce(int&x){x+=x>>31&inf;}
int d[NM][15][15];
int n,m,p;
struct P{
int x,i;
bool operator<(const P&o)const{return x>o.x||(x==o.x&&i>o.i);}
}a[NM];
int main(){
n=read();m=read();p=read();
inc(i,1,n)a[i].x=read(),a[i].i=1;
inc(i,1,m)a[i+n].x=read(),a[i+n].i=2;
n+=m;m=p;
sort(a+1,a+1+n);
d[0][0][0]=1;
inc(i,1,n)inc(j,0,m)inc(k,0,j){
d[i][j][k]=d[i-1][j][k];
if(a[i].i==1&&k)reduce(d[i][j][k]+=d[i-1][j-1][k-1]-inf);
else if(a[i].i==2)reduce(d[i][j][k]+=d[i-1][j][k+1]-inf);
}
return 0*printf("%d\n",d[n][m][0]);
}
|
