#include <iostream>
#include <set>
#include <string>
#include <vector>
#include <iomanip>
#include <algorithm> // для sort
#include <math.h>    /* round, floor, ceil, trunc */
using namespace std;
typedef long long ll;

int main(){

ll n, k, temp, min = 301, c=1;
cin >> n >> k;
vector <ll> a;
for(int i = 0; i < n; i++){
       cin >> temp;
       a.push_back(temp);
}
for(int i = 2; i < n; i++){
       if((a[i] + a[i-1] + a[i-2] < min)){
              min = a[i] + a[i-1] + a[i-2];
              c = i;
       }
}
c-=1;
cout << c;
  return 0;
}