Eri Card

Eri Card became an official event at the 2468 Neptune Olympics. Each team starts a match with $N$ shared number cards and $N$ team number cards.

A match runs like this. The opposing team first blocks $K$ of our team number cards, and a blocked card cannot be played. Once the blocking is over, our team picks one shared number card and one team number card that was not blocked, and plays them. The product of the two numbers is our team's score. The opposing team then scores the same way, and the team with the higher score wins.

The opposing team always blocks in the best way, so it picks the $K$ cards that make our team's score as small as possible. Write a program that prints the maximum score our team can get.

The first line contains $N$ and $K$ ($0 \le K < N \le 100$).

The second line contains the $N$ integers written on the shared number cards.

The third line contains the $N$ integers written on the team number cards.

Each number written on a card is an integer that is at least $-10000$ and less than $10000$.

Print the maximum score our team can get on one line.

In the example the opposing team can block two team number cards. It blocks the cards $4$ and $3$, which could make the largest score, so the remaining team number cards are $-1$, $0$, and $2$. Our team plays the shared card $5$ and the team card $2$ for a score of $10$.