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 long mod = 10^^9 + 7;

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

    if (w == 1) {
        writeln(1);
        return;
    }

    auto m = new long[][](w, w);

    foreach (s ; 0 .. 1<<(w-1)) {
        auto a = iota(w).array;

        if (isCont(s)) {
            continue;
        }

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

        debug {
            writeln(a);
        }

        foreach (i ; 0 .. w) {
            foreach (j ; 0 .. w) {
                if (a[j] == i) {
                    m[i][j]++;
                }
            }
        }
    }

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

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

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

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

    long ans = dp[h][k];
    writeln(ans);
}


bool isCont(int x) {
    int p = 0;

    while (x > 0) {
        if (p == 0) {
            p = x & 1;
            x >>= 1;
        }
        else {
            if (x & 1) {
                return true;
            }
            p = 0;
            x >>= 1;
        }
    }

    return false;
}


unittest {
    //writeln(0b101);
    assert(isCont(0b101) == false);
    assert(isCont(0b0) == false);
    assert(isCont(0b011) == true);
}






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);
        }
    }
}