#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int l, n;
    while (cin>>l>>n) {
        vector<int> a(n);
        for(int& v: a) cin>>v;
        sort(begin(a), end(a));

        int s=0, i;
        for(i=0;i<n;++i) if ((s+=a[i])>l) break;
        cout<<i<<endl;
    }
}