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 JavaScript (node.js v5.12) (judge verdict: Accepted)

// inputに入力データ全体が入る
function Main(input) {
	// 1行目がinput[0], 2行目がinput[1], …に入る
	input = input.split("\n");
     nm = input[0].split(" ");
	//文字列から10進数に変換するときはparseIntを使います
	var N = parseInt(nm[0], 10);
	var M = parseInt(nm[1], 10);
   var n = nm[0];
	var m = nm[1];
  var A ='';var B = '';var AB =[];
  for (i=0;i<M;i++){A +=n;}

　　　
  for (i=0;i<N;i++){B +=m;}
 　　　　 AB.push( A,B);
    
   
 //   console.log(A,B);
 
//  console.log(AB);
  AB.sort();
 // console.log(AB);
 　console.log(AB[0]);
    

	
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));