#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;

const int inf = 1000000009;

int solve(int l, int n) {
    vector<int> w(n);
    for (int i = 0; i < n; i++) scanf("%d", &w[i]);
    sort(all(w));
    int sum = 0;
    int idx = 0;
    while (idx < n && sum <= l) {
	sum += w[idx];
	idx++;
    }
    return idx-(sum > l ? 1 : 0);
}

int main() {
    int l, n;
    scanf("%d%d", &l, &n);
    printf("%d\n", solve(l, n));
}