LISA  Pocket Money
Young people spend a lot of money on things like sweets, music CDs, mobile phones and so on. But most young girls/boys have one problem: Their pocket money is not enough for all these jolly things. Little Lisa Listig is one of these poor girls with a small pocket money budget. Last month her pocket money lasted only one week. So she decided to enter into negotiations with her father. Her father Tomm  a mathematician  had an incredibly ingenious idea: He wrote down some fancy digits with operators (+,*) in between them on a sheet of paper and allowed Lisa to insert brackets. Then he declared that the result of that arithmetic expression is Lisa's new pocket money. Now it's Lisa's task to maximize her pocket money. As her father was surprised what a huge sum of money Lisa got for her result, he decided to minimize the result of the expression for his son Manfred. Now it's your task to calculate the results obtained by Lisa and her father.
Input
The first line of input contains the number of testcases k ( k< 5000 ). Each of the following k lines consists of an arithemtic expression. This expression consists of numbers (09) seperated by one of the two operators '*' and '+'. There are no spaces between the characters. Each line contains less than 100 characters.
Output
For each expression output the result obtained by Lisa and the result obtained by her father separated by one space. The results of the calculations are smaller than 2^{64}.
Example
Input: 1 1+2*3+4*5 Output: 105 27
Two possible expressions for the first testcase:
105 = (1+2)*(3+4)*5 27 = 1+2*3+4*5
hide comments
Shubham:
20121218 20:24:48
if there were no 0, would greedy solution work? 

rohitjv:
20121211 09:41:58
<No spoilers in the comments> Last edit: 20121212 07:48:43 

DivineAtheist:
20120817 20:26:00
<No spoilers in the comments> Last edit: 20121212 07:48:59 

Haidar Abboud:
20110916 16:38:37
You needn't worry much about your solution's complexity (you have a time limit of 32 seconds). Test cases only require like 0.1 seconds though. 

Teodorescu Andrei:
20110616 14:28:54
2+1*0*1+1 might be a tricky case for some approaches. 

Santiago Palacio:
20110609 03:32:37
kennard, i believe the answer would be 22 0 Last edit: 20110609 04:19:25 

Arunesh Mathur:
20110222 11:33:44
Any tricky cases to look out for? 

Kennard:
20110116 05:45:51
what is the answer for

Added by:  Simon 
Date:  20050517 
Time limit:  32s 
Source limit:  8082B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL GOSU JSRHINO 
Resource:  Ulm Algorithm Course SoSe 2005 