#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
#pragma GCC diagnostic ignored "-Wconversion"

#define REP(i,n) for (int i=0;i<(n);i++)
#define REPE(i,n) for (int i=0;i<=(n);i++)

#define init(a,b) memset((a), (b), (sizeof(a)));

#define PI 3.14159265
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main() {
    int L, N;
    cin>>L>>N;
    vector<int> W(N);
    for(int i=0;i<N;i++)cin>>W[i];
    sort(W.begin(), W.end());
    int cnt = 0;
    ll t = 0;
    for(int i=0;i<N;i++){
        t += W[i];
        if(t>L)break;
        cnt++;
    }
    cout<<cnt<<endl;
    return 0;
}