#include <bits/stdc++.h>
using namespace std;

int a[10005], st[10005];
int n, c;
int main()
{
    queue <int> s1;
    cin >> n >> c;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        s1.push(a[i]);
    }
    while (1)
    {
        if (s1.empty())
        {
            break;
        }
        queue <int> tmp;
        tmp = s1;
        vector <int> v;
        int minn = 2000000005;
        for (int i = 1; i <= c; i++)
        {
            //if (!tmp.empty())
            //{
    			int t = tmp.front();
                if (tmp.empty())
                {
                    break;
                }
                tmp.pop();
                v.push_back(t);
                if (t < minn)
                {
    				minn = t;
                }
           // }
        }
        int tot = 0;
        for (int i = 0; i < c; i++)
        {
			if (v[i] != minn)
			{
				tot++;
			}
            else
            {
                break;
            }
        }
        //cout << tot << endl;
        for (int i = 0; i <= tot - 1; i++)
        {
            tmp.push(v[i]);
        }
		for (int i = tot + 1; i <= c - 1; i++)
		{
			tmp.push(v[i]);
		}
        cout << minn << " ";
        s1 = tmp;
    }
    return 0;
}