H, W, K = gets.split.map(&:to_i)

dp = Array.new(H + 1) { Array.new(W + 1, 0) }
dp[0][0] = 1

line_patterns = []

(1..(W / 2)).each do |n|
  if n == 1
    line_patterns << (W - 1).times.map { |i| [i] }
  else
    line_patterns << [*0..(W - 2)].combination(n).select { |l| l.each_cons(2).all? { |a, b| b - a >= 2 } }
  end
end

line_patterns.flatten!(1)
line_patterns << []

H.times do |i|
  line_patterns.each do |pattern|
    W.times do |j|
      if pattern.include?(j)
        dp[i + 1][j + 1] += dp[i][j]
        dp[i + 1][j] += dp[i][j + 1]
      elsif !pattern.include?(j - 1)
        dp[i + 1][j] += dp[i][j]
      end
    end
  end
end

MOD = 10 ** 9 + 7
puts dp[H][K - 1] % MOD
