#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
#define rep(i,x) for(int i=0;i<(int)(x);++i)

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