Little Lesha loves listening to music via his smartphone. But the smartphone doesn't have much memory, so Lesha listens to his favorite songs in a well-known social network InTalk.

Unfortunately, internet is not that fast in the city of Ekaterinozavodsk and the song takes a lot of time to download. But Lesha is quite impatient. The song's duration is T seconds. Lesha downloads the first S seconds of the song and plays it. When the playback reaches the point that has not yet been downloaded, Lesha immediately plays the song from the start (the loaded part of the song stays in his phone, and the download is continued from the same place), and it happens until the song is downloaded completely and Lesha listens to it to the end. For q seconds of real time the Internet allows you to download q - 1 seconds of the track.

Tell Lesha, for how many times he will start the song, including the very first start.

The single line contains three integers T, S, q (2 ≤ q ≤ 10⁴, 1 ≤ S < T ≤ 10⁵).

Print a single integer — the number of times the song will be restarted.

Sample Input

In the first test, the song is played twice faster than it is downloaded, which means that during four first seconds Lesha reaches the moment that has not been downloaded, and starts the song again. After another two seconds, the song is downloaded completely, and thus, Lesha starts the song twice.

In the second test, the song is almost downloaded, and Lesha will start it only once.

In the third sample test the download finishes and Lesha finishes listening at the same moment. Note that song isn't restarted in this case.

题目大意：

一首歌共有t秒，下载s秒后开始播放，边播边下，每q秒可以下载这首歌的（q-1）秒，每当播到未下载的部分时，返回从头开始播放。问下载这首歌需要从头开始播放多少次。

分析:

刚开始看这道题的时候完全不懂这是在干什么。

假设放到未下载点的时候用时x秒，每秒的下载速度（q-1）/q,x=s+x*(q-1)/q,则x=s*q。

代码：

 #include<cstdio>

 #include<iostream>

 using namespace std;

 int main()

 {

     int t,s,q;

     int m=;

     scanf("%d%d%d",&t,&s,&q);

     while(s<t)//判断是否播完

     {

         s=s*q;

         m++;

     }

     printf("%d\n",m);

     return ;

 }