#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
using pp=pair<int,pair<int,int>>;
#define MAX 200003
#define MOD 1000000007
#define INF 1000000000

int main(){
  int L,N;
  cin>>L>>N;
  vector<int> W(N);
  for(int i=0;i<N;i++){
    cin>>W[i];
  }
  sort(W.begin(),W.end());

  int sum=0;
  int ans=0;
  for(int i=0;i<N;i++){
    if(sum+W[i]>L){
      break;
    }
    ans++;
    sum+=W[i];
  }
  cout<<ans<<endl;
}