#include <iostream>
#include <cstring>
#include <queue>
#include <map>
#include <cstdio>
#include <unordered_map>
#include <deque>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#include <array>
#include <bitset>
#include <limits.h>
#include <numeric>
#define x first
#define y second

using namespace std;
typedef  long long LL;
typedef long long ll  ; 
typedef pair<int,int> PII;
typedef pair<int,LL> PIL;
typedef pair<int ,PII> PIII ;
typedef pair<int, pair<PII ,int > > PIIII;
typedef pair<LL , LL> PLL ; 
typedef pair<LL ,int > PLI ;
typedef pair<int,char > PIC ; 
typedef unsigned long long ULL ;
 
const int N = 5e5+10,M = 4e5+10  ;
const LL mod = 1e9+9 , INF = 1e18+10;
const int inf =  1e8 ; 
const double eps = 1e-7 ;
const ULL  P=  131 ;
LL n , m  , k   ;

LL qmi( LL a , LL b ) {
	LL  res = 1;
	while( b ) {
		if( b & 1 ) res = res * a % mod ;
		b >>= 1 ;
		a = a * a % mod ;
	}
	return res ;
}

LL inv(LL x ) {
	return qmi( x , mod - 2 ) ; 
} 

void solve( ) {
	cin >> m >> k ;
	LL ans = 0 , sum = 1 ;
	n = 1 ;
	for(int i = 1 ; i <= k ; ++ i ) {
		LL in = inv(n) ;
		ans += m * in % mod * sum % mod ;
		ans %= mod ;
		sum += ( m - 1 ) * in % mod * sum + m ;
		sum %= mod ; 
		n += m - 1 ;
	}
	cout << ans << '\n' ; 
	
	
	
} 	
 
 
 
int main(){ 	
	ios::sync_with_stdio(false);
	cin.tie( 0 ) ; cout.tie(0) ;
	int T = 1 ;
	// cin >> T ;
	while(T-- ){	
		solve() ;  
   	}        
 	return  0 ;
}