{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eKazari remembered that she had an \u003cb\u003eexpression\u003c/b\u003e $s_0$ before.\u003cbr\u003eDefinition of \u003cb\u003eexpression\u003c/b\u003e is given below in Backus–Naur form.\u003cbr\u003e\u0026lt;expression\u0026gt; ::\u003d \u0026lt;number\u0026gt; | \u0026lt;expression\u0026gt; \u0026lt;operator\u0026gt; \u0026lt;number\u0026gt;\u003cbr\u003e\u0026lt;operator\u0026gt; ::\u003d \"+\" | \"*\"\u003cbr\u003e\u0026lt;number\u0026gt; ::\u003d \"0\" | \u0026lt;non-zero-digit\u0026gt; \u0026lt;digits\u0026gt;\u003cbr\u003e\u0026lt;digits\u0026gt; ::\u003d \"\" | \u0026lt;digits\u0026gt; \u0026lt;digit\u0026gt;\u003cbr\u003e\u0026lt;digit\u0026gt; ::\u003d \"0\" | \u0026lt;non-zero-digit\u0026gt;\u003cbr\u003e\u0026lt;non-zero-digit\u0026gt; ::\u003d \"1\" | \"2\" | \"3\" | \"4\" | \"5\" | \"6\" | \"7\" | \"8\" | \"9\"\u003cbr\u003eFor example, `1*1+1`, `0+8+17` are valid expressions, while +1+1, +1*+1, 01+001 are not.\u003cbr\u003eThough $s_0$ has been lost in the past few years, it is still in her memories. \u003cbr\u003eShe remembers several corresponding characters while others are represented as question marks.\u003cbr\u003eCould you help Kazari to find a possible valid expression $s_0$ according to her memories, represented as $s$, by replacing each question mark in $s$ with a character in 0123456789+* ?\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line of the input contains an integer $T$ denoting the number of test cases.\u003cbr\u003eEach test case consists of one line with a string $s$ $(1 \\le |s| \\le 500, \\sum {|s|} \\le 10 ^ 5)$.\u003cbr\u003eIt is guaranteed that each character of $s$ will be in 0123456789+*? ."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, print a string $s_0$ representing a possible valid expression.\u003cbr\u003eIf there are multiple answers, print any of them.\u003cbr\u003eIf it is impossible to find such an expression, print IMPOSSIBLE."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\r\n?????\r\n0+0+0\r\n?+*??\r\n?0+?0\r\n?0+0?\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e11111\r\n0+0+0\r\nIMPOSSIBLE\r\n10+10\r\nIMPOSSIBLE\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}