#include <vector>
#include <list>
#include <map>
#include <set>
#include "queue"
#include <deque>
#include <stack>
#include <numeric>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <complex>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
using namespace std;
#define MOD1 1000000007
inline void inp(  int  &n ){n=0;int ch=getchar();int sign=1;while( ch < '0' || ch > '9' ){if(ch=='-')sign=-1; ch=getchar();}while( ch >= '0' && ch <= '9' )n = (n<<3)+(n<<1) + ch-'0', ch=getchar();n=n*sign;}
#define pi acos(-1)
#define For(i,a,b) for(int i=a;i<=b;i++)
#define pii pair<long long ,long long >
#define vii vector<pii>
#define ll  long long int
#define loop(i,n) for(ll i=0;i<n;i++)
#define loop2(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define OUT_RT cerr << (float(clock()) / CLOCKS_PER_SEC) << endl
#define display(x) for(ll  i = 0 ;i<x.size();i+=1){cout<<x[i]<<" ";} cout<<endl;
#define displayarr(x,n) loop(i,n){cout<<x[i]<<" ";}cout<<endl;
#define EPS 1e-9
using namespace std;

//Code till the end of the contest
//JAI SHREE KRISHNA




int main()
{
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n,k;
    cin>>n>>k;
    ll cost[n];
    loop(i,n)
    {
        cin>>cost[i];
    }
    if(k==0)
    {
        ll sum = 0 ;
        loop(i,n)
        {
            sum+=cost[i];
        }
        cout<<sum<<endl;
    }
    if(n==3)
    {
      if(k==1)
          {
          cout<<min(cost[0]+cost[2],cost[1]);
          return  0 ;
      }
        else{
            cout<<min(cost[0],min(cost[1],cost[2]));
            return 0 ;
        }
    }

    
    return 0;
    
}