#include <iostream>
#include <algorithm>
using namespace std;
long long pri[100005], now[100005];
int main()
{
	long long n, mon;
	cin >> n >> mon;
	for (int i = 0; i < n; i++)
		cin >> pri[i];
	long long l = 1, h = n, res = 0, s = 0, mid;
	while (l <= h)
	{
		mid = (l + h) / 2;
		long long  sum = 0;
		for (int j = 0; j < n; j++)
		{
			now[j] = pri[j] + (j + 1) * mid;
		}
		sort(now, now + n);
		for (int j = 0; j < mid; sum += now[j++]);
		if (sum <= mon)
		{
			res = mid;
			s = sum;
			l = mid + 1;
		}
		else
		{
			h = mid - 1;
		}
	}
	cout << res << ' ' << s << endl;
	return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	int l[4], s[4], r[4], p[4];
	int flag = 1;
	for (int i = 0; i < 4; i++)
	{
		cin >> l[i] >> s[i] >> r[i] >> p[i];
	}
	for (int i = 0; i < 4; i++)
	{
		if (p[i] && (l[(i + 1) % 4] || s[(i + 2) % 4] || r[(i + 3) % 4] || l[i] || r[i] || s[i]))
			flag = 0;
	}
	cout << (flag ? "NO" : "YES") << endl;
	return 0;
}

#include <iostream>
#include <vector>
using namespace std;
vector<int> deck;
int main()
{
	int n;
	while (cin >> n && n)
	{
		deck.clear();
		for (int i = 0; i <= n; i++)
			deck.push_back(i);
		int tot = 1, kase = 0;
		cout << "Discarded cards:";
		while (tot < n)
		{
			if (kase++) 
				cout << ",";
			cout << ' ' << deck[tot];
			tot++;
			deck.push_back(deck[tot++]);
			n++;
		}
		cout << endl << "Remaining card: " << deck[tot] << endl;
	}
	return 0;
}

#include <iostream>
#include <cmath>
#include <map>
#include <vector>
using namespace std;
vector<int> seq, seq2;
map<vector<int>, int> check;
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		check.clear();
		seq.clear();
		int n;
		cin >> n;
		while (n--)
		{
			int x;
			cin >> x;
			seq.push_back(x);
		}
		check[seq] = 1;
		while (true)
		{
			for (int i = 1; i < seq.size(); i++)
				seq2.push_back(abs(seq[i] - seq[i - 1]));
			seq2.push_back(abs(seq[seq.size() - 1] - seq[0]));
			seq = seq2;
			seq2.clear();
			int flag = 1;
			for (int i = 0; i < seq.size(); i++)
				if (seq[i] != 0)
					flag = 0;
			if (flag)
			{
				cout << "ZERO" << endl;
				goto ends;
			}
			if (check.count(seq))
			{
				cout << "LOOP" << endl;
				goto ends;
			}
			check[seq] = 1;
		}
	ends: ;
	}
	return 0;
}

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
vector<vector<string>> code;
vector<string> line;
int maxLen[200] = { 0 };
int main()
{
	string str, s;
	while (getline(cin, s))
	{
		stringstream ss(s);
		while (ss >> str)
			line.push_back(str);
		code.push_back(line);
		line.clear();
	}
	for (int i = 0; i < 200; i++)
	{
		for (int j = 0; j < code.size(); j++)
			if (i < code[j].size() && code[j][i].size() > maxLen[i])
				maxLen[i] = code[j][i].size();
	}
	for (int i = 0; i < code.size(); i++)
	{
		for (int j = 0; j < code[i].size(); j++)
		{
			cout << code[i][j];
			if (j < code[i].size() - 1)
				for (int k = code[i][j].size(); k < maxLen[j] + 1; k++)
					cout << ' ';
		}
		cout << endl;
	}
	return 0;
}

#include <iostream>
#include <map>
#include <vector>
#include <string>
#include <cstring>
using namespace std;
map<string, int> ID;
vector<string> getStr;
//int table[10010][15];
vector<int> table[10010];
int getID(string& x)
{
	if (ID.count(x))
		return ID[x];
	getStr.push_back(x);
	return ID[x] = getStr.size() - 1;
}
struct point { 
	int x; int y; 
	point(int x1, int x2) :x(x1), y(x2) {};
};
bool operator<(const point& x1, const point& x2)
{
	return x1.x < x2.x || x1.x == x2.x && x1.y < x2.y;
}
map<point, int> check;
void read(int n)
{
	string str;
	char ch = getchar();
	for(int i = 0; i < n; i++)
		while (true)
		{
			ch = getchar();
			if (ch == '\n' || ch == '\r')
			{
				if (!str.empty())
					table[i].push_back(getID(str));
				str.clear();
				break;
			}
			if (ch == ',')
			{
				table[i].push_back(getID(str));
				str.clear();
			}
			else
				str += ch;
		}
}
int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	int n, m;
	while (cin >> n >> m)
	{
		/*for (int i = 0; i < n; i++)
		{
			cin.get();
			for (int j = 0; j < m - 1; j++)
			{
				string str;
				getline(cin, str, ',');
				table[i][j] = getID(str);
			}
			string str;
			cin >> str;
			table[i][m - 1] = getID(str);
		}*/
		read(n);
		int flag = 1;
		for (int c1 = 0; c1 < m; c1++)
			for (int c2 = c1 + 1; c2 < m; c2++)
			{
				if (flag)
				{
					check.clear();
					for (int i = 0; i < n; i++)
					{
						point x(table[i][c1], table[i][c2]);
						if (check.count(x))
						{
							flag = 0;
							cout << "NO" << endl << check[x] + 1 << ' ' << i + 1 << endl << c1 + 1 << ' ' << c2 + 1 << endl;
							break;
						}
						check[x] = i;
					}
				}
			}
		if (flag)
			cout << "YES" << endl;
		memset(table, 0, sizeof table);
		ID.clear();
		getStr.clear();
	}
	return 0;
}

#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <iterator>
#include <algorithm>
using namespace std;
map<set<int>, int> ID;
vector<set<int>> getSet;

int getID(set<int> x)
{
	if (ID.count(x))
		return ID[x];
	getSet.push_back(x);
	return ID[x] = getSet.size() - 1;
}
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		stack<int> s;
		int n;
		cin >> n;
		while (n--)
		{
			char cmd[10];
			cin >> cmd;
			if (cmd[0] == 'P')
				s.push(getID(set<int>()));
			else if (cmd[0] == 'D')
				s.push(s.top());
			else
			{
				set<int> x1 = getSet[s.top()];
				s.pop();
				set<int> x2 = getSet[s.top()];
				s.pop();
				set<int> x;
				if (cmd[0] == 'U')
					set_union(x1.begin(), x1.end(), x2.begin(), x2.end(), inserter(x,x.begin()));
				else if (cmd[0] == 'I')
					set_intersection(x1.begin(), x1.end(), x2.begin(), x2.end(), inserter(x, x.begin()));
				else if (cmd[0] == 'A')
				{
					x = x2;
					x.insert(getID(x1));
				}
				s.push(getID(x));
			}
			cout << getSet[s.top()].size() << endl;
		}
		cout << "***" << endl;
	}
	return 0;
}