#include <iostream>
#include <iomanip>
#include <sstream>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int L,N;
	cin >> L >> N;
	int W[10001] = {0};

	for (int i = 0;i <N;i++){
		cin >> W[i];
	}

	sort(W,W+N);

	int tmp_L = 0;
	int count = 0;

	for (int i=0;i < N;i++){
		tmp_L += W[i];
		if (tmp_L > L){
			break;
		}else{
			count++;
		}
	}

	cout << count << endl;
	return 0;
}