#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <bitset>
#include <functional>
using namespace std;
const constexpr int INF = 1e9;
typedef std::pair<std::string,double> P;

int L, N; 
vector<int> v;
int dist[10001];
void solve(){
    for(int i=0; i<N; ++i){
        int a; cin >> a; v.push_back(a);
    }
    sort(v.begin(), v.end());
    int cnt=0, sum=0;
    for(int i=0; i<N; ++i){
        if(sum+v[i]>L) break;
        sum+=v[i]; cnt++;
    }
    cout << cnt << endl;
}
int main() {
    cin >> L >> N;
    solve();
	return 0;
}