#include<iostream>
#include<stack>
#include<string>
using namespace std;

struct Node{
int num[11];
bool flag;
struct Node operator+(Node p)
{
Node t;
for(int i=0;i<11;i++)
t.num[i]=p.num[i]+num[i];
return t;
}
struct Node operator*(Node p)
{
Node t;
memset(t.num,0,sizeof(t.num));
for(int i=0;i<11;i++)
for(int j=0;j<11;j++)
{
if(i+j>10) continue;
t.num[i+j]+=num[i]*p.num[j];
}
return t;
}
};

Node ans;
stack<Node>sta;

void Solve()
{
while(!sta.empty())
sta.pop();
char str[10],t[10];
scanf("%s",str);
Node tmp,t1;
memset(tmp.num,0,sizeof(tmp.num));
tmp.num[0]=1;
tmp.flag=1;
sta.push(tmp);
while(!sta.empty())
{
scanf("%s",str);
memset(tmp.num,0,sizeof(tmp.num));
if(strcmp(str,"LOOP")==0)
{
scanf("%s",t);
if(strcmp(t,"n")==0)
{
tmp.num[1]=1;
tmp.flag=1;
}
else
{
int a;
sscanf(t,"%d",&a);
tmp.num[0]=a;
tmp.flag=1;
}
sta.push(tmp);
continue;
}

if(strcmp(str,"OP")==0)
{
scanf("%s",t);
if(strcmp(t,"n")==0)
{
tmp.num[1]=1;
tmp.flag=0;
}
else
{
int a;
sscanf(t,"%d",&a);
tmp.num[0]=a;
tmp.flag=0;
}
sta.push(tmp);
continue;
}

if(strcmp(str,"END")==0)
{
t1=sta.top();
sta.pop();
while(t1.flag!=1)
{
tmp=tmp+t1;
t1=sta.top();
sta.pop();
}
tmp=tmp*t1;
tmp.flag=0;
if(sta.empty())
{
ans=tmp;
return;
}
sta.push(tmp);
continue;
}
}
}

void Print()
{
int i;
bool judge=1;
for(i=10;i>=0;i--)
{
if(ans.num[i] && judge)
{
judge=0;
if(i==1)
{
if(ans.num[i]!=1)
printf("%d*n",ans.num[i]);
else
printf("n");
}
else
if(i)
{
if(ans.num[i]!=1)
printf("%d*n^%d",ans.num[i],i);
else
printf("n^%d",i);
}
else printf("%d",ans.num[0]);
}
else
{
if(ans.num[i] && !judge)
{
if(i==1)
{
if(ans.num[i]!=1)
printf("+%d*n",ans.num[i]);
else
printf("+n");
}
else
if(i)
{
if(ans.num[i]!=1)
printf("+%d*n^%d",ans.num[i],i);
else
printf("+n^%d",i);
}
else
printf("+%d",ans.num[0]);
}
}
}
if(judge)
printf("0");
cout<<endl<<endl;
}

int main()
{
int c,i;
cin>>c;
for(i=1;i<=c;i++)
{
Solve();
printf("Program #%d\n",i);
printf("Runtime = ");
Print();
}
return 0;
}