1N, M, K = map(int, input().split())
 2K -= 1
 3ox = K % M
 4oy = K // M
 5def solve(sx, sy, ex, ey):
 6    dp = [[0]*M for _ in range(N)]
 7    dp[sy][sx] = 1
 8    for i in range(sy, ey+1):
 9        for j in range(sx, ex+1):
10            if i-1 >= 0:
11                dp[i][j] += dp[i-1][j]
12            if j-1 >= 0:
13                dp[i][j] += dp[i][j-1]
14    return dp[ey][ex]
15
16if K != -1:
17    print (solve(0, 0, ox, oy) * solve(ox, oy, M-1, N-1))
18else:
19    print (solve(0, 0, M-1, N-1))

 1N = int(input())
 2L = list(map(int, input().split()))
 3dp = [[0]*21 for _ in range(N-1)]
 4
 5dp[0][L[0]] = 1
 6
 7for i in range(0, N-2):
 8    for j in range(21):
 9        if dp[i][j] != 0:
10            k = L[i+1]
11            if k != 0:
12                if 0 <= j+k <= 20:
13                    dp[i+1][j+k] += dp[i][j]
14                if 0 <= j-k <= 20:
15                    dp[i+1][j-k] += dp[i][j]
16            else:
17                dp[i+1][j] = dp[i][j]*2
18print (dp[N-2][L[-1]])

 1S1 = list(input())
 2S2 = list(input())
 3L1 = len(S1)+1
 4L2 = len(S2)+1
 5
 6dp = [[0]*L1 for _ in range(L2)]
 7result = 0
 8
 9for i in range(1, L2):
10    for j in range(1, L1):
11        if S1[j-1] == S2[i-1]:
12            dp[i][j] = dp[i-1][j-1]+1
13            result = max(result, dp[i][j])
14
15print (result)

 1import sys
 2input = sys.stdin.readline
 3
 4N = int(input())
 5L = list(map(int, input().split()))
 6
 7dp = [[0]*N for _ in range(N)]
 8
 9for i in range(N):
10    dp[i][i] = 1
11    if i < N-1 and L[i] == L[i+1]:
12        dp[i][i+1] = 1
13
14for i in range(N, -1, -1):
15    for j in range(i+1, N):
16        if dp[i+1][j-1] and L[i] == L[j]:
17            dp[i][j] = 1
18
19for i in range(int(input())):
20    S, E = map(int, input().split())
21    print (dp[S-1][E-1])

 1S1 = list(input())
 2S2 = list(input())
 3
 4N1 = len(S1)+1
 5N2 = len(S2)+1
 6
 7dp = [[0]*(N1) for _ in range(N2)]
 8
 9for i in range(1, N2):
10    for j in range(1, N1):
11        if S2[i-1] == S1[j-1]:
12            dp[i][j] = dp[i-1][j-1] + 1
13        else:
14            dp[i][j] = max(dp[i-1][j], dp[i][j-1])
15i = N2-1
16j = N1-1
17print (dp[i][j])
18if dp[i][j] == 0:
19    exit()
20
21result = ''
22while True:
23    if i==0 or j==0:
24        break
25
26    if dp[i][j] == dp[i-1][j]:
27        i -= 1
28    elif dp[i][j] == dp[i][j-1]:
29        j -= 1
30    else:
31        result = S1[j-1] + result
32        i -= 1
33        j -= 1
34
35print (result)

 1string = list(input())
 2
 3priority = {'(':0, ')':0, '+':1, '-':1, '*':2, '/':2}
 4operator = []
 5result = ''
 6
 7for c in string:
 8    if c.isalpha():
 9        result += c
10    elif c == '(':
11        operator.append(c)
12    elif c == ')':
13        while operator:
14            op = operator.pop()
15            if op == '(':
16                break
17            result += op
18    else:
19        if operator:
20            if priority[operator[-1]] < priority[c]:
21                operator.append(c)
22            else:
23                while operator and priority[operator[-1]] >= priority[c]:
24                    result += operator.pop()
25                operator.append(c)
26        else:
27            operator.append(c)
28while operator:
29    result += operator.pop()
30
31print (result)

 1N, M = map(int, input().split())
 2
 3L = [list(map(int, input())) for _ in range(N)]
 4
 5dp = [[0]*(M+1) for _ in range(N+1)]
 6
 7result = 0
 8
 9for i in range(1, N+1):
10    for j in range(1, M+1):
11        dp[i][j] = L[i-1][j-1]
12
13        if L[i-1][j-1]:
14            dp[i][j] = min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1])+1
15        result = max(result, dp[i][j])
16
17for i in dp:
18    print (i)
19print (result**2)

 1N = int(input())
 2L = []
 3for i in range(N):
 4    L.append(int(input()))
 5
 6dp = [1]*N
 7
 8for i in range(N):
 9    for j in range(i):
10        if L[j] < L[i]:
11            dp[i] = max(dp[i], dp[j]+1)
12
13print (N-max(dp))

 1import sys
 2input = sys.stdin.readline
 3N = int(input())
 4T = []
 5P = []
 6dp = [0]*(N+1)
 7
 8for _ in range(N):
 9    a, b = map(int, input().split())
10    T.append(a)
11    P.append(b)
12
13for i in range(N-1, -1, -1):
14    if i+T[i] > N:
15        dp[i] = dp[i+1]
16    else:
17        dp[i] = max(P[i]+dp[i+T[i]], dp[i+1])
18
19print (dp[0])

 1N = int(input())
 2L = list(map(int, input().split()))
 3res = 0
 4dp = [[-1000]*N for _ in range(2)]
 5dp[0][0] = L[0]
 6for i in range(1, N):
 7    dp[0][i] = max(dp[0][i-1]+L[i], L[i])
 8    dp[1][i] = max(dp[1][i-1]+L[i], dp[0][i-1])
 9
10print (max(max(dp[0]), max(dp[1])))