h, w, K = STDIN.gets.split(' ').map(&:to_i)

dp = Array.new(h + 1) { Array.new(w, 0)}
dp[0][0] = 1

MOD = 1000000007

for i in 0..(h - 1) do
  for j in 0..(w - 1) do
    for k in 0..((1 << (w - 1)) - 1) do

      invalid = false

      for l in 0..(w - 3) do
        if (((k >> l) & 1) == 1) && (((k >> l + 1) & 1) == 1)
          invalid = true
          break
        end
      end

      # puts "i:#{i} j:#{j} k:#{k} invalid:#{invalid}"
      next if invalid

      if (j >= 1) && (((k >> j - 1) & 1) == 1)
      # go left
        dp[i + 1][j - 1] += dp[i][j]
        dp[i + 1][j - 1] %= MOD
      elsif (j <= w - 2) && (((k >> j) & 1) == 1)
        # go right
        dp[i + 1][j + 1] += dp[i][j]
        dp[i + 1][j + 1] %= MOD
      else
        # go straight
        dp[i + 1][j] += dp[i][j]
        dp[i + 1][j] %= MOD
      end

    end
  end
end

puts dp[h][K - 1]
