#include<bits/stdc++.h>

using namespace std;

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 ans = 0, now = 0;
  for(int i = 0; i < N; i++){
    now += W[i];
    if(now > L)
      break;
    ++ans;
  }
  cout << ans << "\n";
}