H, W, K = gets.chomp.split(" ").map(&:to_i)
MOD = 10 ** 9 + 7

wk = (0...(1<<(W-1))).to_a.select{|n|
  (n[0] == 0 || n[1] == 0) &&
  (n[1] == 0 || n[2] == 0) &&
  (n[2] == 0 || n[3] == 0) &&
  (n[3] == 0 || n[4] == 0) &&
  (n[4] == 0 || n[5] == 0) &&
  (n[5] == 0 || n[6] == 0)
}
t = Array.new(W-1).map.with_index{|m, i|
  wk.count{|n| n[i] == 1}
}
bef = Array.new(W, 0)
bef[0] = 1
H.times{
  nxt = Array.new(W, 0)
  bef.each_with_index{|b, i|
    l = (i==0 ? 0 : t[i-1])
    r = (i==W-1 ? 0 : t[i])
    c = wk.size - l - r
    nxt[i-1] += b*l if i>0
    nxt[i+1] += b*r if i<W-1
    nxt[i] += b*c
  }
  bef = nxt.map{|n| n % MOD}
}

puts bef[K-1]
