During a long bus trip through São Paulo, Miguel likes to observe street signs through the window. The route seems endless: the bus crosses long avenues such as Avenida Sapopemba, Avenida Aricanduva, and Avenida Raimundo Pereira de Magalhães, while Miguel tries to distract himself with the names that appear along the way.

At one point during the trip, as he passes through a region of the city, he sees the same sequence of letters $$$s$$$ repeated $$$p$$$ times. Later, after many stops, he sees the sequence $$$t$$$ repeated $$$q$$$ times.

On the way back home, however, the route is different: first appear the signs with $$$t$$$ repeated $$$q$$$ times, and only afterwards the signs with $$$s$$$ repeated $$$p$$$ times. Miguel decides to mentally compare the two huge letter sequences using lexicographic order, but they are too large to be written out completely.

Given a string $$$u$$$ and a non-negative integer $$$k$$$, let $$$u^k$$$ be the string formed by concatenating $$$k$$$ copies of $$$u$$$. In particular, $$$u^0$$$ is the empty string.

Recall that, in lexicographic order, a string $$$a$$$ is smaller than a string $$$b$$$ if, at the first position where they differ, the character of $$$a$$$ is smaller than the character of $$$b$$$. If one of the strings ends before any difference is found, then the shorter string is considered smaller.

Your task is to compare lexicographically the strings $$$s^p t^q$$$ and $$$t^q s^p$$$.