// かならいさんの指数の nim という嘘解 import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; class Main { public static void main(String[] args) { new Main().run(); } void run() { solve(); } long gcd(long a, long b) { if (a == 0) return b; return gcd(b % a, a); } final long mod = 998244353; long pow(long a, long n) { if (n==0) return 1; return pow(a*a%mod,n/2) * (n%2==1 ? a : 1) % mod; } void solve() { FastScanner sc=new FastScanner(); long H=sc.nextLong(); long W=sc.nextLong(); int M=sc.nextInt(); long ans=0; for (int min=1;min<=M;++min) { ans+=(pow(M-min+1, H) - pow(M-min, H)) * (pow(M-min+1, W) - pow(M-min, W)) % mod; ans %= mod; } ans=(ans % mod + mod) % mod; System.out.println(ans); } static void tr(Object...objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } }