#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main(){
    int L, N, x, n;
    n = 0;
    vector<int> W;
    cin >> L >> N;

    for(int i = 0; i < N; i++){
        cin >> x;
        W.push_back(x);
    }

    sort(W.begin(), W.end());
    
    for(int i = 0; i < N; i++){
        if(L - W[i] >= 0){
            n++;
            L -= W[i];
        }else{
            break;
        }
    }

    cout << n << endl;

    return 0;
}