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

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