#include<bits/stdc++.h>
using namespace std;
int main(){
    int L,N;
    cin>> L >> N;
    vector<int> wide(N);
    for(int i=0;i<N;i++){
        cin >> wide[i];
    }
    
    sort(wide.begin(),wide.end());
    int count = 0;
    int ans = 0;
    for(int i=0;i<N;i++){
        count += wide[i];
        if(count >= L){
            break;
        }
        ans++;
    }
        
    cout << ans << endl;
}