#include <stdio.h>
#include <stdlib.h>

#define ENDD '\0'
#define KIGY '\n'

#define TRUE 0
#define FALSE 1

int compare_int(const void *a, const void *b);

int compare_int(const void *a, const void *b)
{
    return *(int*)a - *(int*)b;
}

int main()
{
        int ch;
        char buff[100000+1];
        long long int buffi;
        long long int L, N ;
        long long int nums[100000+1];

        buffi = 0;
        while( (ch=getc(stdin)) != KIGY) {
                buff[buffi++] = ch;
        }
        buff[buffi] = ENDD;
        L = atoi(buff);
        buffi = 0;
        while( (ch=getc(stdin)) != KIGY) {
                buff[buffi++] = ch;
        }
        buff[buffi] = ENDD;
        N = atoi(buff);

        buffi=0;
        int count = 1;
        int nums_i = 0;
        while( (ch=getc(stdin)) != EOF) {
                        if( ch==' ' ||  ch==KIGY   ) {
                                buff[buffi] = ENDD;
                                nums[nums_i++] = atoll( buff );
                                buffi = 0;
                        }
                        else {
                                buff[buffi++] = ch;
                        }
        }

        qsort( nums, N, sizeof(long long int), compare_int );

        long long int sum = 0;
        for( long long int i = 0; i < N; i++ ) {
                sum += nums[i];
                if( sum > L ) {
                        printf("%lld\n", i );
                        return 0;
                }
        }
        printf("%lld\n", N );

        return 0;
}