package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

var (
	readString func() string
	readBytes  func() []byte
	stdout     *bufio.Writer
)

func init() {
	readString, readBytes = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) (func() string, func() []byte) {
	r := bufio.NewScanner(ior)
	r.Buffer(make([]byte, 1024), int(1e+11))
	r.Split(bufio.ScanWords)

	f1 := func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
	f2 := func() []byte {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Bytes()
	}
	return f1, f2
}

func readInt() int {
	return int(readInt64())
}

func readInt64() int64 {
	i, err := strconv.ParseInt(readString(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(readString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(stdout, f, args...)
}

func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(stdout, args...)
}

func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// readString() string
// readInt() int
// readInt64() int64
// readFloat64() float64

// -----------------------------------------------------------------------------

func main() {
	defer stdout.Flush()

	H := readInt()
	W := readInt()
	K := readInt() - 1
	INF := 1000000007

	if W == 1 {
		if K == 0 {
			println(1)
		} else {
			println(0)
		}
		return
	}

	dp := make([][]int, H+1)
	for i := range dp {
		dp[i] = make([]int, W)
	}

	dp[0][0] = 1
	hs := make([][]int, 0, 256)
	DoWithExhaustive01(W-1, func(p []int) {
		for i := 0; i+1 < len(p); i++ {
			if p[i] == 1 && p[i+1] == 1 {
				return
			}
		}
		q := make([]int, len(p))
		copy(q, p)
		hs = append(hs, q)
	})

	for i := 1; i <= H; i++ {
		for _, h := range hs {
			for j := 0; j < W; j++ {
				// dp[i-1][0]      dp[i-1][1]      dp[i-1][2]
				//            h[0]           h[1]
				// dp[i][0]         dp[i][1]       dp[i][2]
				var lh, rh int
				if 0 < j {
					lh = h[j-1]
				}
				if j+1 < W {
					rh = h[j]
				}
				if 0 < j {
					dp[i][j] = (dp[i][j] + lh*dp[i-1][j-1]%INF) % INF
				}
				if j+1 < W {
					dp[i][j] = (dp[i][j] + rh*dp[i-1][j+1]%INF) % INF
				}
				if 0 < j && j+1 < W {
					dp[i][j] = (dp[i][j] + (1-lh)*(1-rh)*dp[i-1][j]) % INF
				} else if j == 0 {
					dp[i][j] = (dp[i][j] + (1-rh)*dp[i-1][j]) % INF
				} else if j == W-1 {
					dp[i][j] = (dp[i][j] + (1-lh)*dp[i-1][j]) % INF
				}
			}
		}
	}
	println(dp[H][K])
}

// -----------------------------------------------------------------------------

// DoWithExhaustiveBits(n, fn) calls fn with []bool for each n-bit true/false pattern
// e.g.
// DoWithExhaustiveBits(10, func(b []bool) { fmt.Println(b) }
// -> [false, false, false, false, false, false, false, false, false, false]
//    [true, false, false, false, false, false, false, false, false, false]
//    [false, true, false, false, false, false, false, false, false, false]
//    [true, true, false, false, false, false, false, false, false, false]
//    [false, false, true, false, false, false, false, false, false, false]
//    ...
// Note that you need copy() b when you use it out of the call back function.
func DoWithExhaustiveBits(n int, fn func([]bool)) {
	N := 1 << uint(n)
	a := make([]bool, n)
	for i := 0; i < N; i++ {
		for j := 0; j < n; j++ {
			k := n - j - 1
			if i&(1<<uint(j)) == 0 {
				a[k] = false
			} else {
				a[k] = true
			}
		}
		fn(a)
	}
}

// DoWithExhaustive01(n, fn) calls fn with []int for each n-bit 0/1 pattern
// e.g.
// DoWithExhaustive01(10, func(b []int) { fmt.Println(b) }
// -> [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
//    [1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
//    [0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
//    [1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
//    [0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
//    ...
// Note that you need copy() b when you use it out of the call back function.
func DoWithExhaustive01(n int, fn func([]int)) {
	N := 1 << uint(n)
	a := make([]int, n)
	for i := 0; i < N; i++ {
		for j := 0; j < n; j++ {
			k := n - j - 1
			if i&(1<<uint(j)) == 0 {
				a[k] = 0
			} else {
				a[k] = 1
			}
		}
		fn(a)
	}
}


Measured memory_bytes: 640