【Codeforces Round 339 (Div 2)A】【水题 暴力】 LinkCut Tree 输出[l,r]范围内所有的k的幂数

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 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 ≤ 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).

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 number 2⁴ = 16 is greater then 10, thus it shouldn't be printed.

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
LL l, r, k;
int main()
{
	while (~scanf("%lld%lld%lld", &l,&r,&k))
	{
		bool flag = 0;
		LL x = 1;
		while (1)
		{
			if (x >= l&&x <= r)
			{
				flag = 1;
				printf("%lld ", x);
			}
			double p = (double)x*k;
			if (p > 2e18)break;
			x = x*k;
		}
		if (!flag)printf("-1");
		puts("");
	}
	return 0;
}
/*
【trick&&吐槽】
小心爆int

【题意】
输出[l,r]范围内所有的k的幂数

【类型】
水题 暴力

*/