CF614A.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!

程序员罗斯季斯拉夫对基于伸展树（Splay tree）的 Link/Cut Tree 数据结构产生了浓厚兴趣。具体而言，他目前正在研究其中的 expose 操作。

不幸的是，罗斯季斯拉夫无法理解该操作的定义，于是决定向程序员谢列日亚求助。谢列日亚同意帮忙，但前提是罗斯季斯拉夫必须先解决一个简单任务（否则，他又何需学习伸展树呢？）

给定整数 $l$、$r$ 和 $k$，你需要输出所有在区间 $[l, r]$ 内（含端点）的 $k$ 的幂次。然而，罗斯季斯拉夫不愿花时间完成此任务，因为他已沉迷于和格列布一起玩一款名为 Agar 的网络游戏。请帮助他！

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

输入的第一行包含三个以空格分隔的整数 $l$、$r$ 和 $k$（$1 \le l \le r \le 10^{18}$，$2 \le k \le 10^9$）。

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

按升序输出所有在区间 $[l, r]$ 内的 $k$ 的幂。如果不存在这样的数，则输出 -1（不带引号）。

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.

第一个样例的说明：数字 $2^0 = 1$、$2^1 = 2$、$2^2 = 4$、$2^3 = 8$ 均在指定范围内。而 $2^4 = 16$ 大于 $10$，因此不应输出。