Lines

A string \textbf{A} = a_1 a_2 \ldots a_n is called a substring of a string \textbf{B} = b_1 b_2 \ldots b_m if there exists an integer $k$ (1 \leq k \leq m - n + 1) such that a_1 = b_k, a_2 = b_{k+1}, $\dots$, a_n = b_{k+n-1}.

A string $\text{B}$ is called a superstring of $\text{A}$ if $\text{A}$ is a substring of $\text{B}$.

A string \textbf{A} = a_1 a_2 \ldots a_n is lexicographically smaller than a string \textbf{B} = b_1 b_2 \ldots b_m if there exists an integer $k$ such that a_t = b_t for all 1 \leq t \leq k, and either a_{k+1} < b_{k+1}, or the length of $\text{A}$ is $k$ and the length of $\text{B}$ is greater than $k$.

Given strings $\text{S}$ and $\text{T}$, find a string that is both a substring of $\text{S}$ and a superstring of $\text{T}$. If there are multiple such strings, output the longest one. If there are several strings of maximum length, output the lexicographically smallest one.