#include<bits/stdc++.h>
using namespace std;
int n,s,v[100005],minn[100005],maxn[100005];
void print_ans(int *d,int s)
{
	for(int i=1;i<=n;i++)
		if(s>=v[i]&&d[s]==d[s-v[i]]+1)
		{
			cout<<i<<" ";
			print_ans(d,s-v[i]);
			break;
		}
}

int main() 
{
	freopen ("kouka.in","r",stdin);
	freopen ("kouka.out","w",stdout);	
	cin>>n>>s;
	for(int i=1;i<=n;i++)
		cin>>v[i];
	for(int i=1;i<=s;i++)
	{
		maxn[i]=-100000000;
		minn[i]=100000000;
	}
	
	maxn[0]=0;
	minn[0]=0;
	for(int i=1;i<=s;i++){
		for(int j=1;j<=n;j++){
			if(i>=v[j]){
				minn[i]=min(minn[i],minn[i-v[j]]+1);
				maxn[i]=max(maxn[i],maxn[i-v[j]]+1);
			}
		}
	}
	cout<<minn[s]<<" "<<maxn[s]<<endl;
	print_ans(minn,s);
	cout<<endl;
	print_ans(maxn,s);
	cout<<endl;

	return 0;
}