type vector=array[0..50000]of longint;
var i,j,n,s,sum,e:longword;
    v,plus,minus:vector;

procedure qsort(ls,ld:longint;var v:vector);
var i,j,aux:longint;
begin
  i:=ls;j:=ld;
  while true do begin
    while (v[i]<=v[j])and(i<>j) do inc(i);
    if i=j then break;
    aux:=v[i];v[i]:=v[j];v[j]:=aux;dec(j);
    while (v[i]<=v[j])and(i<>j) do dec(j);
    if i=j then break;
    aux:=v[i];v[i]:=v[j];v[j]:=aux;inc(i);
  end;
  if j-1>ls then qsort(ls,j-1,v);
  if j+1<ld then qsort(j+1,ld,v);
end;

function gasit(n,st,dr:longint;var v:vector):boolean;
var m:longint;
begin
gasit:=false;
if st>dr then
        exit;
m:=(st+dr) div 2;
if n=v[m] then
        begin
        gasit:=true;
        exit;
        v[m]:=-1;
        end;
if n<v[m] then
        gasit:=gasit(n,st,m-1,v)
else
        gasit:=gasit(n,m+1,dr,v);
end;

begin
randomize;
assign(input,'semne.in');reset(input);
assign(output,'semne.out');rewrite(output);
readln(n,s);
sum:=0;
plus[0]:=n;
for i:=1 to n do
        begin
        read(v[i]);
        plus[i]:=v[i];
        sum:=sum+v[i];
        end;
while sum<>s do
        begin
        if sum<s then
                begin
                e:=random(minus[0])+1;
                sum:=sum+2*minus[e];
                inc(plus[0]);
                plus[plus[0]]:=minus[e];
                minus[e]:=minus[minus[0]];
                dec(minus[0]);
                end;
        if sum>s then
                begin
                e:=random(plus[0])+1;
                sum:=sum-2*plus[e];
                inc(minus[0]);
                minus[minus[0]]:=plus[e];
                plus[e]:=plus[plus[0]];
                dec(plus[0]);
                end;
        end;
qsort(1,plus[0],plus);
for i:=1 to n do
        begin
        if gasit(v[i],1,plus[0],plus) then
                write('+')
        else
                write('-');
        end;
close(input);close(output);
end.