运用数学知识可知A交B的所有子集皆可
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll P=1e9+7;
ll a,b,c;
inline ll Pow(ll a,ll b){
ll ret=1;
for (;b;b>>=1,a=a*a%P)
if (b&1)
ret=ret*a%P;
return ret;
}
int main(){
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
scanf("%lld%lld%lld",&a,&b,&c);
printf("%lld\n",Pow(2,c));
return 0;
}