150B.md (1325B)
1 Source: https://codeforces.com/problemset/problem/150/B 2 3 B. Quantity of Strings 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Just in case somebody missed it: this winter is totally cold in Nvodsk! It is so cold that one gets funny thoughts. For example, let's say there are strings with the length exactly *n*, based on the alphabet of size *m*. Any its substring with length equal to *k* is a palindrome. How many such strings exist? Your task is to find their quantity modulo 1000000007 (109 + 7). Be careful and don't miss a string or two! 22 23 Let us remind you that a string is a palindrome if it can be read the same way in either direction, from the left to the right and from the right to the left. 24 25 Input 26 27 The first and only line contains three integers: *n*, *m* and *k* (1 ≤ *n*, *m*, *k* ≤ 2000). 28 29 Output 30 31 Print a single integer — the number of strings of the described type modulo 1000000007 (109 + 7). 32 33 Examples 34 35 Input 36 37 ``` 38 1 1 1 39 ``` 40 41 Output 42 43 ``` 44 1 45 ``` 46 47 Input 48 49 ``` 50 5 2 4 51 ``` 52 53 Output 54 55 ``` 56 2 57 ``` 58 59 Note 60 61 In the first sample only one string is valid: "a" (let's denote the only letter of our alphabet as "a"). 62 63 In the second sample (if we denote the alphabet letters as "a" and "b") the following strings are valid: "aaaaa" and "bbbbb".