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

int main(){
   int ans = 0,l,n;
   cin >> l >> n;
   int block[n];
   for(int i = 0;i < n;i++) cin >> block[i];
   stable_sort(block,block + n);
   for(int i = 0;i < n;i++){
      if(l >= block[i]){
         ans++;
         l -= block[i];
      }else break;
   }
   cout << ans << endl;
}