#pragma GCC optimize("Ofast","inline")
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=a;i<=b;i++)
#define Fod(i,b,a) for (int i=b;i>=a;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define _SEED_ ('C'+'L'+'Y'+'A'+'K'+'I'+'O'+'I')
#define outval(x) printf(#x" = %d\n",x)
#define outvec(x) printf("vec "#x" = ");for (auto _v : x)printf("%d ",_v);puts("")
#define outtag(x) puts("----------"#x"----------")
#define outarr(a,L,R) printf(#a"[%d...%d] = ",L,R);\For(_v2,L,R)printf("%d ",a[_v2]);puts("");
using namespace std;
typedef long long LL;
LL read(){LL x=0,f=0;char ch=getchar();while (!isdigit(ch))f|=ch=='-',ch=getchar();while (isdigit(ch))x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return f?-x:x;
}
const int N=500005,mod=19491001,G=7;
int Pow(int x,int y){int ans=1;for (;y;y>>=1,x=(LL)x*x%mod)if (y&1)ans=(LL)ans*x%mod;return ans;
}
int n,k,d;
int Fac[N],Inv[N];
void prework(){int n=N-1;for (int i=Fac[0]=1;i<=n;i++)Fac[i]=(LL)Fac[i-1]*i%mod;Inv[n]=Pow(Fac[n],mod-2);Fod(i,n,1)Inv[i-1]=(LL)Inv[i]*i%mod;
}
int C(int n,int m){if (m>n||m<0)return 0;return (LL)Fac[n]*Inv[m]%mod*Inv[n-m]%mod;
}
int main(){prework();n=read(),k=read(),d=read();if (d==1){cout<<Pow(k,n)<<endl;}else if (d==2){int ans=0;For(i,0,k){int c=(i-(k-i)+mod)%mod;ans=((LL)C(k,i)*Pow(c,n)+ans)%mod;}ans=(LL)ans*Pow(2,mod-1-k)%mod;cout<<ans<<endl;}else {int ans=0;int w0=1,w1=Pow(G,(mod-1)/3),w2=(LL)w1*w1%mod;For(i,0,k)For(j,0,k-i){int c=((LL)w0*i+(LL)w1*j+(LL)w2*(k-i-j))%mod;ans=((LL)C(k,i)*C(k-i,j)%mod*Pow(c,n)+ans)%mod;}ans=(LL)ans*Pow(3,mod-1-k)%mod;cout<<ans<<endl;}return 0;
}