#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int l, n;
    cin >> l >> n;
    int ws[n];
    for (int i = 0; i < n; i++) {
        int w;
        cin >> w;
        ws[i] = w;
    }
    sort(ws,ws+n);
    int ans = 0;
    for (int i = 0; i < n && l >= ws[i]; i++,ans++)
        l -= ws[i];
    cout << ans << endl;
    return 0;
}