def is$\_$valid$\_$substring$($substring$,$ s$2)$:

return substring in s$2$ or substring$[$::$-1]$ in s$2$

def find$\_$substrings$($s$1,$ s$2)$:

substrings $=[]$

i $=0$

j $=0$

while i $<$ len$($s$1)$:

found $=$ False

# Try to find the longest valid substring starting from i

for j in range$($len$($s$1),$ i$,-1)$:

substring $=$ s$1[$i:j$]$

if is$\_$valid$\_$substring$($substring$,$ s$2)$:

substrings.append$($substring$)$

i $=$ j

found $=$ True

break

# If no valid substring is found, it's impossible

if not found:

return $["$Impossible$"]$

return substrings

# Input

s$1=$ input$().$strip$()$

s$2=$ input$().$strip$()$

# Find and print the substrings

result $=$ find$\_$substrings$($s$1,$ s$2)$

print$("|".$join$($result$))$

The time limit is exceeded it is showing when running the program