#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
    ll h;
    cin >> h;
    ll n;
    cin >> n;
    vector<ll> a(n);
    for(int i = 0;i < n;i++)cin >> a[i];
    sort(a.begin(),a.end());
    ll now = 0;
    ll res = 0;
    for(int i = 0;i < n;i++){
        if(now + a[i] > h)break;
        now += a[i];
        res++;
    }
    cout << res << endl;
}