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

int main() {
    int l,n,ans = 0;
    cin >> l >> n;
    vector<int> w(n,0);
    for(int i = 0;i < n;i++){
        cin >> w[i];
    }
    sort(w.begin(), w.end());
    for(int i = 0;i < n;i++){
        if(l < w[i])break;
        l -= w[i];
        ans++;
    }
    cout << ans << endl;
    return 0;
}