#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
const int N=2005;
const ll mod=998244353;
int n,m;
ll dp[N][N],D;
void work()
{if(1LL*n>=1LL*m*D||m<=1){puts("0");return ;}memset(dp,0,sizeof(dp));for(int i=0;i<=min(m-1,n);i++)dp[1][i]=1;for(int i=2;i<=D;i++)for(int j=0;j<min(1LL*n,D*m);j++)for(int k=0;k<=min(m-1,n-j);k++)(dp[i][j+k]+=dp[i-1][j])%=mod;ll ans=0;for(int i=1;i<=D;i++)(ans+=dp[i][n])%=mod;cout<<ans%mod<<endl;
}
int main()
{while(1){scanf("%d%lld%d",&n,&D,&m);if(n==0&&D==0&&m==0)break;work();}return 0;
}

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int N=2005;
typedef long long ll;
const ll mod=998244353;
ll dp[N][N],n,d,m,fac[N],C[N],sum[N];
ll qpow(ll a,ll b)
{ll res=1;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}//if(res<0)cout<<"Jackpot!"<<endl;return res;
}
ll inv(ll x)
{return qpow(x,mod-2);
}
void work()
{if(n>=m*d||m<=1){puts("0");return ;}memset(dp,0,sizeof(dp));memset(sum,0,sizeof(sum));C[0]=1;for(int i=1;i<=min(n,d);i++){C[i]=(C[i-1]*(1LL*(d-i+1)%mod))%mod*inv(i)%mod;
/*        if(C[i]<0)while(1);cout<<"***"<<C[i]<<endl;*/}for(int i=1;i<m;i++)dp[1][i]=1,(sum[i]=sum[i-1]+dp[1][i])%=mod;for(int i=m;i<=n;i++)sum[i]=sum[i-1];for(int i=2;i<=n;i++){for(int j=1;j<=n;j++)dp[i][j]=(sum[j-1]-sum[max(0LL,j-m)]+mod)%mod;//    sum[0]=0;for(int j=1;j<=n;j++)(sum[j]=sum[j-1]+dp[i][j])%=mod;}ll ans=0;for(int i=1;i<=min(d,n);i++)(ans+=dp[i][n]*C[i]%mod)%=mod;cout<<ans<<endl;}
int main()
{while(1){scanf("%lld%lld%lld",&n,&d,&m);if(!n&&!d&&!m)break;work();}return 0;
}

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#define pa pair<int,int>
using namespace std;
const int N=10005,M=40005;
int n,m,T;
int to[M<<1],dis[N],vis[N],nxt[M<<1],tot,head[N],del[M<<1],len[M<<1];
int read()
{int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();return x*f;
}
void add(int x,int y,int z)
{to[++tot]=y;len[tot]=z;nxt[tot]=head[x];head[x]=tot;
}
void dj(int s)
{memset(dis,0x3f,sizeof(dis));memset(vis,0,sizeof(vis));priority_queue<pa> q;dis[s]=0;//vis[s]=1;q.push(make_pair(0,s));while(!q.empty()){int x=q.top().second;q.pop();if(vis[x])continue;vis[x]=1;for(int i=head[x];i;i=nxt[i]){if(del[i])continue;int y=to[i];if(dis[y]>dis[x]+len[i]){dis[y]=dis[x]+len[i];q.push(make_pair(-dis[y],y));}}}/*for(int i=1;i<=n;i++)cout<<dis[i]<<' ';puts(" ");*/
}
void ini()
{for(int i=1;i<=n;i++)head[i]=0;for(int i=1;i<=m*2;i++)to[i]=nxt[i]=del[i]=len[i]=0;tot=1;
}
void work()
{n=read();m=read();ini();for(int i=1;i<=m;i++){int x=read(),y=read(),z=read();add(x,y,z);add(y,x,z);}int ans=0x3f3f3f3f;;for(int i=head[1];i;i=nxt[i]){int y=to[i];del[i]=del[i^1]=1;dj(y);del[i]=del[i^1]=0;ans=min(ans,dis[1]+len[i]);}cout<<(ans==0x3f3f3f3f?-1:ans)<<endl;return ;
}
int main()
{T=read();while(T--)work();return 0;
}