#include <fstream>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#define N 50002
using namespace std;
struct lol
{
int x, poz;
} sub[N], add[N];
int v[N], i, n, aux, p, m;
long long s, sum;
bool semn[N];
int main()
{
ifstream f("semne.in");
ofstream g("semne.out");
srand(time(NULL));
f >> n >> s;
for(i=1; i<=n; ++i)
{
f >> v[i];
aux = rand() % 2;
if(aux)
{
sum += v[i];
add[++p].x = v[i];
add[p].poz = i;
}
else
{
sum -= v[i];
sub[++m].x = v[i];
sub[m].poz = i;
}
}
while(sum != s)
{
if(sum < s)
{
aux = 1 + rand() % m;
add[++p] = sub[aux];
sum += 2*sub[aux].x;
swap(sub[aux], sub[m--]);
}
else
{
aux = 1 + rand() % p;
sub[++m] = add[aux];
sum -= 2*add[aux].x;
swap(add[aux], add[p--]);
}
}
for(i=1; i<=m; ++i)
semn[sub[i].poz] = 1;
for(i=1; i<=n; ++i)
if(semn[i]) g << "-";
else g << "+";
f.close();
g.close();
return 0;
}