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

int main(){
  int L, N;
  cin >> L;
  cin >> N;
  int Wi[N];
  for(int i = 0; i < N; i++)
    cin >> Wi[i];
  sort(Wi, Wi + N);
  int count = 0;
  for(int i = 0; i < N; i++){
    if(Wi[i] <= L){
      L -= Wi[i];
      count++;
    } else {
      break;
    }
  }
  cout << count << endl;
}