[CodeForces - 614A] A - Link/Cut Tree

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 exposeprocedure.

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 ≤ 10¹⁸, 2 ≤ k ≤ 10⁹).

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 2⁰ = 1, 2¹ = 2, 2² = 4, 2³ = 8 lie within the specified range. The number 2⁴ = 16 is greater then 10, thus it shouldn't be printed.

题目意思是,给你一个区间和一个数,求有几个这个数的正整数次幂在这个区间内.

由于数据很大,在判断是否超出R的时候可能会爆long long.所以在判断时不能用乘,而应该用除,这样就不会爆了.

 #include<cstdio>
 #include<algorithm>
 using namespace std;
 long long L,R,K;
 int main(){
     scanf("%lld%lld%lld",&L,&R,&K);
     ; ;
     ;}
     ; R/x>=K; i++){
         x*=K; ;}
     }
     ) puts("-1");
     ;
 }