krsu 3404 (20 points)

# by: senb1 aka amigo

X, Y, Z = map(int, input().split())
A = [0] * (X+Y+Z)
B = [0] * (X+Y+Z)
C = [0] * (X+Y+Z)

for i in range(X+Y+Z):
    A[i], B[i], C[i] = map(int, input().split())

dp = [[[0 for k in range(Z+1)] for j in range(Y+1)] for i in range(X+1)]

for i in range(X+1):
    for j in range(Y+1):
        for k in range(Z+1):
            if i > 0:
                dp[i][j][k] = max(dp[i][j][k], dp[i-1][j][k] + A[i+j+k-1])
            if j > 0:
                dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k] + B[i+j+k-1])
            if k > 0:
                dp[i][j][k] = max(dp[i][j][k], dp[i][j][k-1] + C[i+j+k-1])

print(dp[X][Y][Z])