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

using namespace std;

int main(int argc, char const *argv[])
{
    int boxSize;
    int blockNum;
    vector<int> blockWidth;
    
    cin >> boxSize >> blockNum;

    int i, tmp;
    for(i = 0; i < blockNum; i++){
        cin >> tmp;
        blockWidth.push_back(tmp);
    }

    sort(blockWidth.begin(), blockWidth.end());

    int count = 0;
    int sum = 0;
    while((count < blockNum) && ((sum + blockWidth.at(count)) <= boxSize)){
        sum = sum + blockWidth.at(count);
        count++;
    }

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