#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep2(i,a,n) for(int i = (a);i < (n);i++)
#define rep(i,n) rep2(i,0,n)
#define INF (1LL << 60)

int main(void){
    int l,n;
    cin >> l >> n;
    int w[n];
    rep(i,n)cin >> w[i];
    sort(w,w+n);
    
    int sum = 0;
    rep(i,n){
        sum += w[i];
        if(sum > l){
            cout << i << endl;
            break;
        }
        if(i == n-1 && sum <= l){
            cout << i+1 << endl;
            break;
        }
    }
}