#include<bits/stdc++.h> using namespace std; queue<int> q; int main() { int n , m; cin >> n >> m; for(int i = 1;i <= n;i++){ int a; cin >> a; q.push(a); } int cnt = 0; while(!q.empty()){ cnt++; if(cnt != m){ q.push(q.front()); q.pop(); } else if(cnt == m){ cout << q.front() << " "; cnt = 0; m = q.front(); q.pop(); } } return 0; }