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


int first_occurence(vector<int> &arr,int k){
	int n = arr.size();
	int low=0;
	int high = n-1;
	int ans=-1;
	
	while(low<=high){
		int mid = (low+high)/2;
		if(arr[mid]==k){
			ans=mid;
			high=mid-1;
		}
        else{
        if(arr[mid]<k){
        	low=mid+1;}
        else{
        	high=mid-1;
        }
        }
	}
	
	return ans;
	
}

int last_occurence(vector<int> &arr,int k){
	int n = arr.size();
	int low=0;
	int high = n-1;
	int ans=-1;
	
	while(low<=high){
		int mid = (low+high)/2;
		if(arr[mid]==k){
			ans=mid;
			low=mid+1;
		}
		else{
			
	    if(arr[mid]<k){
        	low=mid+1;}
        else{
        	high=mid-1;
        }
			
		}
	}
	
	return ans;
	
}
int main() {
	// your code goes here
    int n,k;
	cin>>n>>k;
	vector<int> arr(n);
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	
	int low=0;
	int high=n-1;
	int ans=-1;
	
	while(low<=high){
		int mid = (low+high)/2;
		
		int l1 = k*(mid/k);
		int h1=  l1+k-1;
		
		if(h1>=n  || arr[l1]!=arr[h1]){
			ans=arr[mid];
			high=mid-1;
		}
		else{
			low=h1+1;
		}
	}

		// if(arr[l1]!=arr[mid]){
		// 	cout<<arr[mid]<<endl;
		// 	return 0;
			
		// }
		
		// if(l1+k-1<n && arr[h1]!=arr[mid]){
		// 	cout<<arr[mid]<<endl;
		// 	return 0;
			
		// }
	 //   int a = abs(h1-l1+1);

	//     if(a!=k){
	//     	cout<<arr[mid]<<endl;
	//     	return 0;
	    	
	//     }
	//     else{
	//     	if((h1-low+1)%k==0){
	//     		low=h1+1;
	//     	}
	//     	else{
	//     		high=l1-1;
	//     	}
	//     }
	// }
	
	cout<<ans<<endl;
	return 0;
}