#include <iostream>
#include <vector>
using namespace std;

const int MOD = 1e9 + 7;

int countValidDirections(int N, int K, vector<int>& sizes) {
    // Initialize DP table
    vector<vector<int>> dp(N + 1, vector<int>(2, 0));
    dp[K][0] = 1; // Rózsabimbó can start moving left
    dp[K][1] = 1; // Rózsabimbó can start moving right

    // Process each larva from K to N
    for (int i = K; i < N; ++i) {
        if (sizes[i] < sizes[i + 1]) {
            dp[i + 1][0] = (dp[i + 1][0] + dp[i][0]) % MOD;
            dp[i + 1][1] = (dp[i + 1][1] + dp[i][1]) % MOD;
        } else {
            dp[i + 1][0] = (dp[i + 1][0] + dp[i][1]) % MOD;
            dp[i + 1][1] = (dp[i + 1][1] + dp[i][0]) % MOD;
        }
    }

    // Process each larva from K to 1
    for (int i = K; i > 1; --i) {
        if (sizes[i] < sizes[i - 1]) {
            dp[i - 1][0] = (dp[i - 1][0] + dp[i][0]) % MOD;
            dp[i - 1][1] = (dp[i - 1][1] + dp[i][1]) % MOD;
        } else {
            dp[i - 1][0] = (dp[i - 1][0] + dp[i][1]) % MOD;
            dp[i - 1][1] = (dp[i - 1][1] + dp[i][0]) % MOD;
        }
    }

    // The result is the sum of all valid configurations
    int result = (dp[N][0] + dp[N][1] + dp[1][0] + dp[1][1]) % MOD;
    return result;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, K;
    cin >> N >> K;
    vector<int> sizes(N + 1);
    for (int i = 1; i <= N; ++i) {
        cin >> sizes[i];
    }

    int result = countValidDirections(N, K, sizes);
    cout << result << endl;

    return 0;
}