#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int q;
cin >> q;
while (q--)
{
int n;
cin >> n;
vector<int> prob;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
prob.push_back(temp);
}
sort(prob.begin(), prob.end());
int passed = prob[0], ans = 1, penality = passed;
for (int i = 1; i < n; i++)
{
if (passed + prob[i] <= 300)
{
ans++;
passed += prob[i];
penality += passed;
}
else
break;
}
cout << ans << " " << penality << endl;
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKQp7CgogICAgaW50IHE7CiAgICBjaW4gPj4gcTsKICAgIHdoaWxlIChxLS0pCiAgICB7CiAgICAgICAgaW50IG47CiAgICAgICAgY2luID4+IG47CiAgICAgICAgdmVjdG9yPGludD4gcHJvYjsKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgICAgICB7CiAgICAgICAgICAgIGludCB0ZW1wOwogICAgICAgICAgICBjaW4gPj4gdGVtcDsKICAgICAgICAgICAgcHJvYi5wdXNoX2JhY2sodGVtcCk7CiAgICAgICAgfQogICAgICAgIHNvcnQocHJvYi5iZWdpbigpLCBwcm9iLmVuZCgpKTsKICAgICAgICBpbnQgcGFzc2VkID0gcHJvYlswXSwgYW5zID0gMSwgcGVuYWxpdHkgPSBwYXNzZWQ7CiAgICAgICAgZm9yIChpbnQgaSA9IDE7IGkgPCBuOyBpKyspCiAgICAgICAgewogICAgICAgICAgICBpZiAocGFzc2VkICsgcHJvYltpXSA8PSAzMDApCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGFucysrOwogICAgICAgICAgICAgICAgcGFzc2VkICs9IHByb2JbaV07CiAgICAgICAgICAgICAgICBwZW5hbGl0eSArPSBwYXNzZWQ7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgZWxzZQogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgfQoKICAgICAgICBjb3V0IDw8IGFucyA8PCAiICIgPDwgcGVuYWxpdHkgPDwgZW5kbDsKICAgIH0KfQ==