Codeforces-----614A---Link/Cut Tree---数学水题

Link/Cut Tree

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying theexpose 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 numberk 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 froml to r in the increasing order. If there are no such numbers, print "-1" (without the quotes).

Examples

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 number2⁴ = 16 is greater then10, thus it shouldn't be printed.

求n在区间内的幂，用换底公式求出上限，从零开始遍历即可，注意一点换底时可能出现精度问题

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<iostream>
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
using namespace std; 
const int maxn = 1e5+10;
typedef long long LL;
using namespace std;
int main(){
	LL l, r, k;
	cin >> l >> r >> k;
	int n = log10(r)/log10(k);
	bool flag = false;
	for(int i = 0; i <= n+1; i++){//避免精度问题，加1
		LL ans = powl(k, i);
		if(ans >= l && ans <= r){
			cout << ans << ' ';
			flag = true;
		}
	}
	if(flag) cout << endl;
	else cout << -1 << endl;
	return 0;
}