#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

fn main() {
    let mut sc = Scanner::new();
    let h: usize = sc.cin();
    let w: usize = sc.cin();
    let k: usize = sc.cin();

    let mut c: Vec<Vec<i64>> = vec![vec![0; w]; w];
    for iset in 0..1<<(w-1) {
        let mut valid = true;
        let b: Vec<_> = (0..w+1).map(|i|
            if i == 0 || i == w {
                0
            } else {
                (iset >> (i - 1)) & 1
            }
        ).collect();
        // trace!(&b);

        for i in 0..b.len() - 1 {
            if b[i] == 1 && b[i + 1] == 1 { valid = false; }
        }
        if !valid { continue }

        for i in 0..w-1 {
            if b[i + 1] == 1 {
                c[i][i + 1] += 1;
                c[i + 1][i] += 1;
            }
        }
        for i in 0..w {
            if b[i] == 0 && b[i + 1] == 0 {
                c[i][i] += 1;
            }
        }
    }
    // trace!(&c);

    let mut dp = vec![vec![0i64; w]; h + 1];
    dp[0][0] = 1;
    for i in 0..h {
        for j in 0..w {
            if j > 0 { dp[i + 1][j] += dp[i][j-1] * c[j-1][j]; }
            dp[i + 1][j] %= M;
            if j < w - 1 { dp[i + 1][j] += dp[i][j+1] * c[j+1][j]; }
            dp[i + 1][j] %= M;
            dp[i + 1][j] += dp[i][j] * c[j][j];
            dp[i + 1][j] %= M;
        }
        // trace!(&dp[i+1]);
    }
    put!(dp[h][k - 1]);
}

use std::io::{self, Write};
use std::str::FromStr;
use std::collections::VecDeque;

struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
impl Scanner {
    fn new() -> Self { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> { self.cin::<String>().chars().collect() }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> { (0..n).map(|_| self.cin()).collect() }
}


Measured memory_bytes: 4352