#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 1000000009
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
int n,m;
inline ll quickPower(ll x,ll y)
{
    ll res=1;
    while (y)
    {
        if (y&1) res=res*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return res;
}
void BellaKira()
{
    cin>>n>>m;
    int a=0,x=1,b=0;
    for (int i=1;i<=m;i++)
    {
        int coef=1*quickPower(x,mod-2)%mod;
        a=(a+(b*n%mod)%mod*coef%mod+n)%mod;
        b=(b+b*(n-1)%mod*coef%mod+n)%mod;
        x+=n-1;
    }
    cout<<a<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/