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

vector<int> arr;

void radix_sort() {
  for(int i = 0; i < 32; i++){
    queue<int> queues[2];
    for (unsigned j = 0; j < arr.size(); j++)
      queues[(bool) (arr[j] & (1 << i))].push(arr[j]);
    arr.clear();
    for(int k = 0; k <= 1; k++){
      while(!queues[k].empty()){
        arr.push_back(queues[k].front());
        queues[k].pop();
      }
    }
  }
}

int main() {
  int i, L, N;
  cin >> L >> N;
  for (i = 0; i < N; i++) {
    int x;
    cin >> x;
    arr.push_back(x);
  }
  radix_sort();
  for (i = 0; i < N; i++) {
    L -= arr[i];
    if (L < 0) break;
  }
  cout << i << endl;
  return 0;
}