#include <iostream>
#include <queue>
using namespace std;
int main(){
        int L,N;
        cin >> L >> N;
        priority_queue<int> circle;
        for(int i=0 ; i<N ; i++ ){
                int x;cin >> x;
                circle.push(x*-1);
        }
        int counter=0;
        while(L+circle.top()>=0 && circle.size()!=0 ){
                L+=circle.top();
                circle.pop();
                counter++;
        }
        cout << counter << endl;
}