using System;
using System.Linq;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;
using static System.Math;
using System.Numerics;

namespace AtCoder
{
    public class Program
    {
        public static void Main(string[] args)
        {
            //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
            Solve();
            //Out.Flush();
            Read();
        }

        static void Solve()
        {
            var (H, W, K) = Slice3<long>();
            if (W == 1)
            {
                WriteLine(1);
                return;
            }
            //横棒の割り振り
            var nums = new long[W];
            nums[0] = 1;
            nums[1] = 2;
            for (var i = 2; i < W; ++i)
                nums[i] = (nums[i - 1] + nums[i - 2]) % Mod;
            var dp = new long[H + 1, W];
            dp[0, 0] = 1;
            for (var i = 0; i < H; ++i)
            {
                for (var j = 0; j < W; ++j)
                {
                    //上からきたやつ
                    var t = dp[i, j];
                    //そのまま下へ移動する場合//左と右が空白
                    var pl = Max(0, j - 1);
                    var l = nums[pl];
                    var pr = Max(0, W - 1 - (j + 1));
                    var r = nums[pr];
                    var tt = t * l % Mod * r % Mod;
                    dp[i + 1, j] = (dp[i + 1, j] + tt) % Mod;
                    //右へ移動する場合//左一つ目と右二つ目が空白
                    if (j + 1 < W)
                    {
                        var prr = Max(0, pr - 1);
                        var rr = nums[prr];
                        tt = t * l % Mod * rr % Mod;
                        dp[i + 1, j + 1] = (dp[i + 1, j + 1] + tt) % Mod;
                    }
                    //左へ移動する場合//左二つ目と右一つ目が空白
                    if (0 <= j - 1)
                    {
                        var pll = Max(0, pl - 1);
                        var ll = nums[pll];
                        tt = t * ll % Mod * r % Mod;
                        dp[i + 1, j - 1] = (dp[i + 1, j - 1] + tt) % Mod;
                    }
                }
            }
            var ans = dp[H, K - 1];
            WriteLine(ans);
        }

        static long Mod = (long)1e9 + 7;
        private static int pl;

        static public long[] Sarray() { return ReadLine().Split().Select(long.Parse).ToArray(); }
        static public List<long> Slist() { return ReadLine().Split().Select(long.Parse).ToList(); }
        static public (T1 a, T2 b) Slice<T1, T2>()
        {
            var t = ReadLine().Split();
            return (
            (T1)Convert.ChangeType(t[0], typeof(T1)),
            (T2)Convert.ChangeType(t[1], typeof(T2)));
        }
        static public (T a, T b) Slice2<T>()
        {
            var t = ReadLine().Split();
            return (
            (T)Convert.ChangeType(t[0], typeof(T)),
            (T)Convert.ChangeType(t[1], typeof(T)));
        }
        static public (T a, T b, T c) Slice3<T>()
        {
            var t = ReadLine().Split();
            return (
            (T)Convert.ChangeType(t[0], typeof(T)),
            (T)Convert.ChangeType(t[1], typeof(T)),
            (T)Convert.ChangeType(t[2], typeof(T)));
        }
        static public (T a, T b, T c, T d) Slice4<T>()
        {
            var t = ReadLine().Split();
            return (
            (T)Convert.ChangeType(t[0], typeof(T)),
            (T)Convert.ChangeType(t[1], typeof(T)),
            (T)Convert.ChangeType(t[2], typeof(T)),
            (T)Convert.ChangeType(t[3], typeof(T)));
        }
    }
}

Measured memory_bytes: 27508