#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long int ll; typedef pair P; const ll MOD=1e9+7; ll powmod(ll a, ll k){ ll ap=a, ans=1; while(k>0){ if(k%2==1){ ans*=ap; ans%=MOD; } ap=ap*ap; ap%=MOD; k/=2; } return ans; } ll inv(ll a){ return powmod(a, MOD-2); } int main() { int n, m; ll p; cin>>n>>m>>p; p=p*inv(100ll)%MOD; ll f[100001]; f[0]=1; for(ll i=1; i<=m+n; i++) f[i]=f[i-1]*i%MOD; ll invf[200001]; invf[m+n]=inv(f[m+n]); for(ll i=m+n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD; ll s[100001]; s[0]=0; for(int i=0; i>v; s[i+1]=s[i]+v; } ll ans=0; ll ps=0; for(int i=0; i<=n-1; i++){ ll q=f[i+m-1]*invf[i]%MOD*invf[m-1]%MOD*powmod((1-p+MOD)%MOD, (ll)i)%MOD*powmod(p, (ll)m)%MOD; ps=(ps+q)%MOD; ans+=(q*s[i]%MOD); ans%=MOD; } ans+=((1-ps+MOD)%MOD*s[n]%MOD); ans%=MOD; cout<