#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int max_m=60002;
int n,m,k[max_m],l,ans;
long long sum;
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%d",&k[i]);
    }
    sort(k+1,k+m+1); //排序
    l=1; //初始化
    while(sum+k[l]<=n&&l<=m){
        sum+=k[l]; //求和
        ans++; //计数+1
        l++; //指针+1
    }
    printf("%d\n",ans);
    return 0;
}