A - Link/Cut Tree

Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the expose procedure.

Unfortunately, Rostislav is unable to understand the definition of this procedure, so he decided to ask programmer Serezha to help him. Serezha agreed to help if Rostislav solves a simple task (and if he doesn't, then why would he need Splay trees anyway?)

Given integers l, r and k, you need to print all powers of number k within range from l to r inclusive. However, Rostislav doesn't want to spent time doing this, as he got interested in playing a network game called Agar with Gleb. Help him!

Input

The first line of the input contains three space-separated integers l, r and k (1 ≤ l ≤ r ≤ 1018, 2 ≤ k ≤ 109).

Output

Print all powers of number k, that lie within range from l to r in the increasing order. If there are no such numbers, print "-1" (without the quotes).

**Example
Input**

1 10 2

Output

1 2 4 8 

Input

2 4 5

Output

-1

Note

Note to the first sample: numbers 20 = 1, 21 = 2, 22 = 4, 23 = 8 lie within the specified range. The number 24 = 16 is greater then 10, thus it shouldn't be printed.

注意：这个题数据比较大，超过long long 后会从负的开始导致WA，一开始我总是WA还以为是自己的数据开的不够大…… 还有一点需要注意的就是k = 1的情况，这时候如果l = 1则只输出一个1。下面是emmm……在大佬帮助下的代码，感谢RY大佬。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>

int main()
{
    long long int  l, r, k, m;
    while(~scanf("%lld %lld %lld", &l, &r, &k))
    {
        int flag = 0;
        m = 1;
        while(1)
        {
            if(flag)
            printf(" ");
            if(m >= l && m <= r)
            {
                flag = 1;
                printf("%lld", m);
            }
            if(r/k >= m && k != 1) //这里用r/k控制一下范围不容易超
                m *= k;
            else
                break;
        }
        if(flag)
        printf("\n");
        else
        printf("-1\n");
    }
    return 0;
}