CF1389E Calendar Ambiguity

Description

Berland year consists of $ m $ months with $ d $ days each. Months are numbered from $ 1 $ to $ m $ . Berland week consists of $ w $ days. The first day of the year is also the first day of the week. Note that the last week of the year might be shorter than $ w $ days. A pair $ (x, y) $ such that $ x < y $ is ambiguous if day $ x $ of month $ y $ is the same day of the week as day $ y $ of month $ x $ . Count the number of ambiguous pairs.

Input Format

N/A

Output Format

N/A

Explanation/Hint

Here are the pairs for the first test case: ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF1389E/6a0ee9ce628b44306135f6834937af49e302ba2c.png)