#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}


int main(){
  int L,N; cin >> L >> N;
  vector<int> W(N); rep(i,N) cin >> W[i];
  sort(all(W));
  int ans = 0;
  int sum = 0;
  rep(i,N){
    if(sum+W[i]<=L){
      sum += W[i];
      ans++;
    }
    else break;
  }
  cout << ans << endl;
  return 0;
}