#include <bits/stdc++.h>
using namespace std;
#define REP(i,N) for(i=0;i<N;i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct{
  int first;
  int second;
  int third;
}T;

//昇順
bool comp_Se(T& l, T& r){
  return l.second < r.second;
}

int main(void){
  int L,N;
  cin >> L >> N;
  int i,x,num=0;
  priority_queue<int, vector<int>, greater<int> > W;
  REP(i,N){
    cin >> x;
    W.push(x);
  }
  while(W.size()){
    if(L>W.top()){
      L-=W.top();
      W.pop();
      num++;
    }else break;
  }
  cout << num << endl;
  return 0;
}