#include<iostream>
#include<vector>
#include<algorithm>

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FUNCTION__ << endl;
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) begin(a),end(a)
#define SORT(a) sort(ALL(a))
using namespace std;

int main(){
    int L, N;
    cin >> L >> N;
    vector<int>Ws(N);
    REP(i, N) cin >> Ws[i];
    SORT(Ws);
    int sum = 0;
    int i;
    for (i = 0; i < N; i++)
    {
        sum += Ws[i];
        if (sum > L) break;
    }
    cout << i << endl;

    return 0;
}