Given: A sequence of k-mers Pattern_{1}, ... , Pattern_{n} such that the last k - 1 symbols of Pattern_{i} are equal to the first k - 1 symbols of Pattern_{i+1} for i from 1 to n-1.

Return: A string Text of length k+n-1 where the i-th k-mer in Text is equal to Pattern_{i} for all i.