import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main{ public static void main(String[] args) { new Main().run(); } final long MOD=(long)1e9+7; long pow(long a,long n) { return n!=0?pow(a*a%MOD,n/2)*(n%2==1?a:1)%MOD:1; } long inv(long a) { return pow(a,MOD-2); } int MAX=(int)3e5; long[] fac=new long[MAX]; long[] ifac=new long[MAX]; { fac[0]=ifac[0]=1; for (int i=1;i x // xo -> x // oo -> o // xx -> o // N+M-(連結成分の数) void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int M=sc.nextInt(); int K=sc.nextInt(); long ans=0; for (int k=0;k<=N+M;++k) { if (k%2!=0) continue; //正直者の連結成分の数と嘘つきの連結成分は等しい if (N+M-k Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }