#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;

int main() {

    int N, K;
    cin >> N >> K;
    vector<int> v;
    for (int i = 0; i < N; ++i) {
        int A;
        cin >> A;
        v.push_back(A);
    }
    bool haveNaturalNumber = false;
    for (int i = 0; i < N; ++i) {
        if (v[i] > 0) {
            haveNaturalNumber = true;
        }
    }

    if (haveNaturalNumber) {
        sort(v.begin(), v.end(), greater<int>());
        int sum = 0;
        for (int i = 0; i < K; ++i) {
            if (v[i] <= 0) {
                break;
            }
            sum += v[i];
        }
        cout << sum << endl;
    } else {
        sort(v.begin(), v.end(), greater<int>());
        cout << v[0] << endl;
    }
}