import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {

    private static final long MOD = 1_000_000_007;

    private static int nextUnitAmida(int x) {
        int mask1 = 1;
        int mask2 = 3;
        ++x;
        for (;;) {
            int ck = x & mask2;
            if (ck == mask1) {
                break;
            } else if (ck == mask2) {
                x += mask1;
            }
            mask1 <<= 1;
            mask2 <<= 1;
        }
        return x;
    }

    private static int[] createUnitAmida(int w) {
        List<Integer> uAmidas = new ArrayList<>();
        int x = 0;
        int limit = (1 << (w - 1));
        do {
            uAmidas.add(x);
            x = nextUnitAmida(x);
        } while (x < limit);

        int[] result = new int[uAmidas.size()];
        for (int i = 0; i < result.length; ++i) {
            result[i] = uAmidas.get(i);
        }
        return result;
    }

    private final int height;

    private final int width;

    private final int[] unitAmidas;

    private Main(int h, int w) {
        height = h;
        width = w;
        unitAmidas = createUnitAmida(w);
    }

    long countIt(int goal) {
        return countSub(height, 1, goal);
    }

    private final Map<Integer, Integer> cache = new HashMap<>();

    int createCacheKey(int h, int start, int goal) {
        int result;
        if (start < goal) {
            result = ((start - 1) * 8 + (goal - 1)) * 100 + (h - 1);
        } else {
            result = ((goal - 1) * 8 + (start - 1)) * 100 + (h - 1);
        }
        return result;
    }

    private long countSub(int h, int start, int goal) {
        int key = createCacheKey(h, start, goal);
        if (!cache.containsKey(key)) {
            long result = countSubP(h, start, goal);
            cache.put(key, (int)result);
        }
        return cache.get(key).longValue();
    }

    private long countSubP(int h, int start, int goal) {
        if (Math.abs(start - goal) > h) {
            return 0;
        }
        if (h > 1) {
            final int h1 = h / 2;
            final int h2 = h - h1;
            long result = 0;
            if (h1 == h2 && start == goal) {
                for (int k = 0; k < width; ++k) {
                    long r1 = countSub(h1, start, k + 1);
                    result += r1 * r1;
                }
            } else {
                for (int k = 0; k < width; ++k) {
                    long r1 = countSub(h1, start, k + 1);
                    long r2 = countSub(h2, k + 1, goal);
                    result += r1 * r2;
                }
            }
            return (result < MOD ? result : result % MOD);
        }

        assert h == 0;

        final int rMask = (1 << (start - 1));
        final int lMask = (rMask >> 1);

        int rCase = 0;
        int lCase = 0;
        int mCase = 0;

        for (int unitAmida : unitAmidas) {
            if ((unitAmida & rMask) != 0) {
                ++rCase;
            } else if ((unitAmida & lMask) != 0) {
                ++lCase;
            } else {
                ++mCase;
            }
        }

        long result;
        if (start == goal) {
            result = mCase;
        } else if (start == goal - 1) {
            result = rCase;
        } else {
            result = lCase;
        }
        return result;
    }

    public static void main(String[] args) {
        try (
                Scanner in = new Scanner(System.in);
                PrintWriter out = new PrintWriter(System.out))
        {
            final int H = in.nextInt();
            final int W = in.nextInt();
            final int K = in.nextInt();

            long result = new Main(H, W).countIt(K);
            out.println(result);
        }
    }
}


Measured memory_bytes: 22996