/*Huyyt*/

#include<bits/stdc++.h>

#define mem(a,b) memset(a,b,sizeof(a))

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

const int dir[][] = {{, }, {, }, {, -}, { -, }, {, }, {, -}, { -, -}, { -, }};

const int mod = 1e9 + , gakki =  +  +  +  + 1e9;

const int MAXN = 2e5 + , MAXM = 2e5 + , N = 2e5 + ;

const int MAXQ = ;

/*int to[MAXM << 1], nxt[MAXM << 1], Head[MAXN], tot = 1;

inline void addedge(int u, int v)

{

        to[++tot] = v;

        nxt[tot] = Head[u];

        Head[u] = tot;

}*/

inline void read(int &v)

{

        v = ;

        char c = ;

        int p = ;

        while (c < '' || c > '')

        {

                if (c == '-')

                {

                        p = -;

                }

                c = getchar();

        }

        while (c >= '' && c <= '')

        {

                v = (v << ) + (v << ) + c - '';

                c = getchar();

        }

        v *= p;

}

int num[];

int main()

{

        int n;

        int k;

        int minn = INT_MAX;

        int aim;

        read(n), read(k);

        for (int i = ; i <= n; i++)

        {

                read(num[i]);

                if (num[i] < minn)

                {

                        minn = num[i];

                        aim = i;

                }

        }

        int ans = ;

        ans = INT_MAX;

        int anser = ;

        for (int laim = max(, aim - k + ); laim <= aim; laim++)

        {

                int raim = min(n, laim + k - );

                anser = ;

                if ((laim - ) % (k - ))

                {

                        anser++;

                }

                anser += (laim - ) / (k - );

                if ((n - raim) % (k - ))

                {

                        anser++;

                }

                anser += (n - raim) / (k - );

                ans = min(ans, anser);

        }

        cout << ans << endl;

        return ;

}

#include "bits/stdc++.h"

using namespace std;

typedef long long ll;

double Snuke(ll x)

{

        ll tmp = , c = x;

        while (c)

        {

                tmp += c % ;

                c /= ;

        }

        return 1.0 * x / tmp;

}

int main()

{

        int K;

        cin >> K;

        ll res = , x = ;

        while (K--)

        {

                double t1, t2;

                while (true)

                {

                        t1 = Snuke(res + x), t2 = Snuke(res + x * );

                        if (t1 <= t2)

                        {

                                break;

                        }

                        x *= ;

                }

                res += x;

                printf("%lld\n", res);

        }

        return ;

}