#include using namespace std; #define rep(i,n) for(int i=0;i> L >> N; vector W(N); rep(i, N) cin >> W[i]; sort(begin(W), end(W)); int count = 0; for(;L > 0;){ L -= W[count]; count++; } cout << count-1 << endl; return 0; }