import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int h, w, k;
    scan(h, w, k);

    auto c = new int[][](w, w);

    foreach (s ; 0 .. (1 << (w - 1))) {
        if (s & (s >> 1)) continue;
        auto p = iota(0, w).array;

        foreach (i ; 0 .. w - 1) {
            if (s & (1 << i)) {
                swap(p[i], p[i + 1]);
            }
        }

        foreach (i ; 0 .. w) {
            c[i][p[i]]++;
        }
    }

    debug {
        writefln("%(%s\n%)", c);
    }

    auto dp = new long[][](h + 1, w);
    dp[0][0] = 1;

    foreach (i ; 1 .. h + 1) {
        foreach (j ; 0 .. w) {
            foreach (s ; 0 .. w) {
                dp[i][j] += dp[i - 1][s] * c[s][j] % mod;
                dp[i][j] %= mod;
            }
        }
    }

    debug {
        writefln("%(%s\n%)", dp);
    }

    auto ans = dp[h][k - 1];
    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
