Problem:
Score : 200 points

Problem Statement

Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?

Constraints

1 \leq a \leq 9

1 \leq b \leq 9

a and b are integers.

Input

Input is given from Standard Input in the following format:

a b

Output

Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)

Sample Input 1

4 3

Sample Output 1

3333

We have two strings 444 and 3333. Between them, 3333 is the lexicographically smaller.

Sample Input 2

7 7

Sample Output 2

7777777

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::{stdin, Read};

macro_rules! parse {
    ($iter: ident) => {
        $iter.next().unwrap().parse().unwrap()
    };
    ($iter: ident,2) => {
        (parse!(iter), parse!(iter))
    };
    ($iter: ident,3) => {
        (parse!(iter), parse!(iter))
    };
    ($iter: ident,4) => {
        (parse!(iter), parse!(iter))
    };
}

fn main() {
    let mut s = String::new();
    stdin().read_to_string(&mut s).unwrap();
    let mut iter = s.split_whitespace();
    let a = iter.next().unwrap();
    let b = iter.next().unwrap();
    let ai: usize = a.parse().unwrap();
    let bi: usize = a.parse().unwrap();
    let aa = (0..bi).map(|_| a).collect::<String>();
    let bb = (0..ai).map(|_| b).collect::<String>();
    if aa < bb {
        println!("{:}", aa); // DEBUG
    } else {
        println!("{:}", bb); // DEBUG
    }
}