using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var len = 1 << n;
        var x = new long[len][];
        for (var i = 0; i < len; ++i)
        {
            x[i] = new long[len];
            for (var j = 0; j < len; ++j) if (Popcount(i & j) >= k) x[i][j] = 1;
        }
        var a = new long[1][] { Enumerable.Repeat(1L, len).ToArray() };
        if (m > 1)
        {
            a = Matrix.Mul(a, Matrix.Pow(x, m - 1));
        }
        var ans = 0L;
        for (var i = 0; i < len; ++i) ans = (ans + a[0][i]) % mod;
        WriteLine(ans);
    }
    static int Popcount(int n)
    {
        var ans = 0;
        while (n > 0)
        {
            ans += n % 2;
            n >>= 1;
        }
        return ans;
    }
    static int mod = 998_244_353;
    class Matrix
    {
        // 行列の累乗
        public static long[][] Pow(long[][] m, long k)
        {
            var multi = m;
            var r = new long[m.Length][];
            for (var i = 0; i < m.Length; ++i)
            {
                r[i] = new long[m.Length];
                r[i][i] = 1;
            }
            while (k > 0)
            {
                if ((k & 1) == 1) r = Mul(r, multi);
                multi = Mul(multi, multi);
                k >>= 1;
            }
            return r;
        }
        // 行列の積
        public static long[][] Mul(long[][] x, long[][] y)
        {
            var r = new long[x.Length][];
            for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length];
            for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k)
            {
                for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod;
            }
            return r;
        }
    }
}