#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, cnt = 0, w[10000] = {};
    cin >> l >> n;
    rep(i, n) cin >> w[i];
    sort(w, w+n);
    for (int i = 0; l >= 0; ++i, ++cnt) l -= w[i];
    cout << cnt - 1 << endl;
    return 0;
}