Image Shrinking

There is a rectangular image with $n$ pixels of height and $m$ pixels of width. Jeonghwi chose suitable positive integers $i$ and $j$, scaled the image's height by a factor of $i$ and its width by a factor of $j$, and produced an image with $ni$ pixels of height and $mj$ pixels of width. For some reason the original image was deleted, so Jeonghwi asks you to reconstruct it.

Given the enlarged image, find and output the smallest possible original image. For convenience, each pixel is represented by a lowercase letter (a, b, ... , z, ASCII codes 97-122).

The first line gives the dimensions of the enlarged image as integers $ni$ and $mj$, separated by a space.

From the second line, $ni$ lines follow, each containing $mj$ letters that represent the pixel values of the image.

Output the possible original image with the smallest area.

The first line contains the height and width of the original image as integers $n$ and $m$, separated by a space.

From the second line, $n$ lines follow, each containing $m$ letters that represent the original image.

If multiple answers are possible, output any one of them.

• $1 \leq ni, mj \leq 1\,000$
• Each pixel of the image is represented by a lowercase letter (a, b, ... , z, ASCII codes 97-122).