import itertools

MOD = 998244353

def generate_sequences(N, M):
    for A in itertools.product(range(2**M), repeat=N):
        yield A

def bitwise_and(A):
    res = A[0]
    for i in range(1, len(A)):
        res &= A[i]
    return res

def pow_mod(base, exponent, mod):
    res = 1
    while exponent > 0:
        if exponent % 2 == 1:
            res = (res * base) % mod
        base = (base * base) % mod
        exponent //= 2
    return res
def main():
    N, M, L = map(int, input().split())

    sequences = list(generate_sequences(N, M))
    
    for k in range(1, L+1):
        total = 0
        for A in sequences:
            and_result = bitwise_and(A)
            total += pow_mod(and_result, k, MOD)
            total %= MOD
        print(total)

if __name__ == '__main__':
    main()