Sports Day

Dankook University Affiliated Software High School (Dankook Sogo) is holding a sports day. The event is a team competition. A total of $N$ teams take part, and each team has $M$ members. At the end of each round, one of the remaining members is eliminated at random. A team is eliminated when all of its members are eliminated. The final rank of each team is determined by the reverse of the elimination order. The team eliminated last becomes the overall winner.

The event has progressed until $a$ people remain in total, and $K$ of them are on Junhyeok's team. Junhyeok wants to know the range of ranks his team can still get. The rank that Junhyeok's team can currently have is equal to (the number of remaining teams excluding Junhyeok's team + 1).

Given $N$, $M$, $a$, and $K$, find the largest and smallest ranks Junhyeok's team can currently have.

The first line contains $N$, $M$, $a$, and $K$, separated by spaces. $(1 \le N, M \le 10^9, 1 \le a \le N \times M, 1 \le K \le M, K \le a)$

On the first line, print the largest and smallest ranks Junhyeok's team can have, separated by a space.