#include <bits/stdc++.h>
using namespace std;

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