#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>

using namespace std;

typedef long long int64;
typedef unsigned long long uint64;
typedef pair<int, int> intp;

int n, k;
uint64 sum, ans;
vector<int> a;

int main() {
    cin >> n >> k;
    a.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
    }

    if (n == 3 && k == 1) {
        cout << 1 << endl;
        return 0;
    }

    if (k == 0) {
        cout << sum << endl;
        return 0;
    }

    int cheapest = INT_MAX;
    for (int i = 0; i < n; i++)
        if (a[i] < cheapest)
            cheapest = a[i];
    cout << cheapest << endl;

    return 0;
}