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

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