#include <iostream>
#include <vector>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SORT(a) sort((a).begin(),(a).end())
#define PB push_back
using namespace std;
typedef vector<int> VI;

int main(){
  int L, N;
  cin >> L >> N;
  VI v;
  REP(i,N){
    int W;
    cin >> W;
    v.PB(W);
  }
  SORT(v);
  int r = 0;
  while(r < N && L >= v[r]){
    L -= v[r];
    ++r;
  }
  cout << r << endl;
}