#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main()
{
    int l, n;
    cin >> l >> n;
    vector<int> w(n);
    rep(i, 0, n){
        cin >> w[i];
    }
    sort(w.begin(), w.end());
    int sum = 0;
    int ans = 0;
    rep(i, 0, n){
        sum += w[i];
        if(sum > l) break;
        ans++;
    }
    cout << ans << endl;
    return 0;
}