Lexicographic String Comparison

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given Unicode strings $a,b$, print Booleans for a < b, a == b, a > b in that order. Comparison follows Unicode code-point order.

Input

Line 1 contains $a$; line 2 contains $b$.

Output

One line with three True/False tokens separated by spaces.

Subtask

• Subtask 1 — 100 points: $0\le |a|,|b|\le100$ Unicode code points, excluding CR, LF and NUL.

Example

Input

An
An

Output

False True False

Explanation

The strings match character-by-character: less is False, equal is True, greater is False.