MOD=998244353
N=9

def solve(W,H,X):
    ans=0
    for min_e in range(N+1):
        for max_e in range(min_e,N+1):
            if H==2 and not (min_e==0 and max_e==0):
                continue
            if H==2:
                pat_e=1
            else:
                d=max_e-min_e+1
                pat_e=pow(d,H//2-1,MOD)-2*pow(d-1,H//2-1,MOD)+pow(max(0,d-2),H//2-1,MOD)
                pat_e%=MOD
            for min_o in range(N+1):
                for max_o in range(min_o, N+1):
                    pat_o=pow(max_o-min_o+1,H//2,MOD)-2*pow(max_o-min_o,H//2,MOD)+pow(max(0,max_o-min_o-1),H//2,MOD)
                    pat_o%=MOD
                    for a00 in range(N+1):
                        upper_o=min(X-a00-max_o,N)
                        lower_o=max(X-a00-N-min_o,0)
                        upper_e=min(a00+min_o,N)
                        lower_e=max(-N+a00+max_o,0)
                        if H>=3:
                            upper_o=min(upper_o,N-a00+min_e)
                            lower_o=max(lower_o,-a00+max_e)
                            upper_e=min(upper_e,N+a00-max_e)
                            lower_e=max(lower_e,a00-min_e)
                        if upper_o-lower_o<0 or (W>2 and upper_e-lower_e<0):
                            continue
                        add=pow(upper_o-lower_o+1,W//2,MOD)*pow(upper_e-lower_e+1,W//2-1,MOD)%MOD*pat_e%MOD*pat_o%MOD
                        add%=MOD
                        ans=(ans+add)%MOD
    print(ans)

W,H,X=map(int,input().split())
if W%3>H%3:
    W,H=H,W
if (W%3==0 and H%3==0) or (W%3==0 and H%3==1) or (W%3==1 and H%3==1):
    print(int(X<=N))
elif W%3==0 and H%3==2:
    print(pow(max(2*N-X+1,0),W//3,MOD))
elif W%3==1 and H%3==2:
    print(pow(max(2*N-X+1,0),(W+1)//3,MOD))
elif W%3==2 and H%3==2:
    solve((W+1)//3*2,(H+1)//3*2,X)
else:
    raise Exception