https://vjudge.net/problem/Gym-101933E
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
int n,m,d;
int mp[2][10];
unordered_map<ll,double>dp;
ll getsta()
{
ll ans=0;
for(int i=1;i<=6;i++) ans*=10,ans+=mp[1][i];
for(int i=1;i<=6;i++) ans*=10,ans+=mp[0][i];
return ans;
}
double dfs(ll sta,int limit)
{
if(sta<1000000) return 1;
if(limit==0) return 0;
if(dp.count(sta)) return dp[sta];
int num=0;
for(int i=0;i<2;i++)
{
for(int j=1;j<=6;j++)
{
num+=mp[i][j];
}
}
double ans=0;
for(int i=1;i>=0;i--)
{
for(int j=1;j<=6;j++)
{
if(!mp[i][j]) continue;
mp[i][j]--;
mp[i][j-1]++;
ll newsta=getsta();
double nex=dfs(newsta,limit-1);
dp[newsta]=nex;
mp[i][j]++;
mp[i][j-1]--;
ans+=(double)mp[i][j]/(double)num*nex;
}
}
return ans;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
scanf("%d%d%d",&n,&m,&d);
for(int i=0;i<n;i++)
{
int x;
sfi(x);
mp[0][x]++;
}
for(int i=0;i<m;i++)
{
int x;
sfi(x);
mp[1][x]++;
}
double ans=dfs(getsta(),d);
printf("%.12lf\n",ans);
return 0;
}