#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

void cont(vector<pair<int,int> > a,int n,int m)
{
	sort(a.begin(),a.end());
	
	int checker = 0;
	int sum = n;
	for(int i=m-1;i>=0;i--)
	{
		sum-=a[i].first;
		checker++;
		if(sum<=0)break;
	}

	int ans = m-checker;

	cout<<checker<<endl;
	for(int i=m-1;i>=ans;i--)
	{
		cout<<a[i].second<<' ';
	}
}

int main()
{
	int n,m,sum1=0;//n-, m- sum1-   
	cin>>n>>m;

	vector<pair<int,int> > a(m);

	for(int i=0;i<m;i++)
	{
		int temp1,temp2;
		temp2 = i+1;
		cin>>temp1;
		sum1+=temp1;
		a[i]=make_pair(temp1,temp2);
	}
	if(sum1 == n&& m==1){cout<<1<<endl<<1;return 0;}
	if(sum1<n+2)
	{
		if(m==2&&sum1<=n+1)cont(a,n,m);
		else
		cout<<"Epic fail\n";return 0;
	}	
	cont(a,n,m);
	return 0;
}