#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;

int main(void){
//input
	int L,N;
	cin >> L;
	cin >> N;
	
	int box[N];
	for(int i=0;i<N;i++){
		cin >> box[i];
	}
//calc
	vector<int> boxes;
	for(int i=0;i<N;i++){
		boxes.push_back(box[i]);
		int sum = accumulate(boxes.begin(),boxes.end(),0);
		if(sum > L){
			boxes.erase(max_element(boxes.begin(),boxes.end()));
		}
	}
	int cnt = boxes.size();
//output
	cout << cnt << endl;
}