#include <stdio.h>
#include <algorithm>
int L,N;
int main(){

    //input
    scanf("%d",&L);
    scanf("%d",&N);

    int M[N];
    for (int i = 0;i < N;i++){
        scanf("%d",&M[i]);
    }

    //sort M
    std::sort(M,M+N);

    //count maximum
    int cLength = 0;
    int maximum = 0;
    for (int i = 0;i < N;i++){
        if (cLength+M[i] <= L){
            cLength += M[i];
            maximum++;
        }else{
            break;
        }
    }

    printf("%d\n",maximum);
    
    return 0;
}