#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

void solve()
{
    int n, t;
    cin >> n >> t;
    vi a(n + 2);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    
    vi dis(n + 2), vis(n + 2);
    for (int i = 0; i < n; i++)
    {
        int x = i, y = a[0];
        if (y < x) dis[i] = x - y + 1;
        else dis[i] = n - y + x + 1;
    }

    priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> q;
    for (int i = 1; i < n; i++)
        q.push({dis[i], i});

    while (!q.empty())
    {
        auto [_, u] = q.top();
        q.pop();
        if (vis[u]) continue;
        auto calc = [&](int x)
        {
            if (dis[u] + 1 < dis[x])
            {
                dis[x] = dis[u] + 1;
                q.push({dis[x], x});
            }
        };

        calc(a[u]);
        calc(u + 1);
    }
    cout << dis[t] << "\n";
}

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

    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++)
        solve();

    return 0;
}