#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int L,N,i;
    int sum = 0;
    cin >> L >> N;
    int temp;
    vector<int> vec;
    for(i=0;i<N;i++){
        cin >> temp;
        vec.push_back(temp);
    }
    sort(vec.begin(), vec.end());
    for(i=0;i<N;i++){
        sum += vec[i];
        if(sum > L){
            if(i == 0) cout << 1;
            else cout << i;
        break;
        }
        if(i == N - 1){
            cout << L;
        }
    }

}