#include <iostream>
#include <vector>
#include <queue>
using ll = long long;
using namespace std;

int main() {
    int n, l,a, sum=0;
    priority_queue<int, vector<int>, greater<> > Q;
    cin >> l >> n;
    for (int i = 0; i < n; ++i) {scanf("%d", &a); Q.push(a);}
    a = -1;
    while (!Q.empty() && sum < l){
        sum += Q.top(); Q.pop();
        a++;
    }
    cout << a << "\n";
    return 0;
}