fib (-1) = 0
fib 0 = 1
fib 1 = 1
fib n = (fib (n - 1)) + (fib (n - 2))
-- fib n = [1, 1, 2, 3, 5, 8, 13, 21] !! n

solve 0 w 1 = 1
solve 0 w k = 0
solve h w k
    | k < 1 || w < k = 0
    | otherwise =
        sum
        [ (solve (h - 1) w k) * (fib (k - 1)) * (fib (w - k))
        , (solve (h - 1) w (k - 1)) * (fib (k - 2)) * (fib (w - k))
        , (solve (h - 1) w (k + 1)) * (fib (k - 1)) * (fib (w - k - 1))
        ] `mod` (10 ^ 9 + 7 :: Int)

main = do
    [h, w, k] <- map read . words <$> getLine :: IO [Int]
    print $ solve h w k