n,m,d=map(int,input().split())
M=998244353
D=[1]*(2**n)
for i in range(m-1):
    nD=[0]*(2**n)
    for j in range(2**n,2**(n+1)):
        key=str(bin(j))[3:]
        for k in range(2**n,2**(n+1)):
            kay=str(bin(k))[3:]
            #print(key,kay)
            cnt=0
            for t in range(n):
                if key[t]=="1" and kay[t]=="1":
                    cnt+=1
            if cnt>=d:
                nD[j-2**n]+=D[k-2**n]
                nD[j-2**n]%=M
    D=nD[:]
print(sum(D)%M)