#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int l,n;
    int w[100000];
    cin >> l >> n;
    for(int i = 0;i < n;i++){
        cin >> w[i];
    }
    sort(w,w + n);
    int ans = 0;
    int leng = 0;
    for(int i = 0;i < n;i++){
        if(leng + w[i] <= l){
            leng += w[i];
            ans++;
        }else{
            break;
        }
    }
    cout << ans << endl;
    return 0;
}