{"raw_statement":[{"iden":"statement","content":"ArabellaCPC's Judges decided to print the problem statements.\n\nEach one of the $n$ participated teams will get exactly one copy of the problem-statements, and each copy costs $k$ coins.\n\nHow many coins it will cost judges to print exactly one problem-statements for each team.\n\nThe input consists of two integers $n$ and $k$, $(1 <= n, k <= 1000)$\n\nprint the total cost of all problem statements.\n\n"},{"iden":"input","content":"The input consists of two integers $n$ and $k$, $(1 <= n, k <= 1000)$"},{"iden":"output","content":"print the total cost of all problem statements."},{"iden":"examples","content":"Input5 3\nOutput15\nInput4 1\nOutput4\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ x, y \\in \\mathbb{Z} $ denote the amount of money Hamza has and the cost of the sandwich, respectively.\n\n**Constraints**  \n$ 1 \\le x, y \\le 10 $\n\n**Objective**  \nOutput $ 1 $ if $ x \\ge y $, otherwise output $ 0 $.","simple_statement":"If Hamza has at least as much money as the sandwich costs, print 1. Otherwise, print 0.","has_page_source":false}