var
  i,j:longint;
  ans,a,h,b,n,k,q,p:int64;
begin
  read(n,k,h);
  //if (k div h=n) and (k mod h=0) then begin writeln(1);halt;end;

  p:=2;
  q:=2;
  a:=1;
  for i:=1 to n+k-1 do
  begin
    a:=a*i;
    while (p<n) and (a mod p=0) do
    begin
    a:=a div p;
    inc(p);
    a:= a mod 1000000007;
    end;

    while (q<n) and (a mod q=0) do
    begin
    a:=a div q;
    inc(q);
    a:= a mod 1000000007;
    end;
  end;
  writeln(a mod 1000000007);
end.