{"raw_statement":[{"iden":"problem statement","content":"In _K-city_, there are $n$ streets running east-west, and $m$ streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?"},{"iden":"constraints","content":"*   $2 ≤ n, m ≤ 100$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$n$ $m$"},{"iden":"sample input 1","content":"3 4"},{"iden":"sample output 1","content":"6\n\nThere are six blocks, as shown below:\n\n![image](https://atcoder.jp/img/abc069/9179be829dc9810539213537d4c7398c.png)"},{"iden":"sample input 2","content":"2 2"},{"iden":"sample output 2","content":"1\n\nThere are one block, as shown below:\n\n![image](https://atcoder.jp/img/abc069/997bfafa99be630b54d037225a5c68ea.png)"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}