The boss instructed Vitya to scan a large number of documents.
The scanner scans one document in $$$k$$$ minutes. Vitya is busy with his main work, so he decides to approach the scanner every $$$t$$$ minutes. If the scanner has not finished scanning a document by that time, Vitya leaves; otherwise, he starts the scanning of the next document. Vitya will be scanning documents throughout the entire workday that lasts $$$T$$$ minutes.
How many documents can Vitya manage to start scanning?
The first line contains three integers $$$t$$$, $$$k$$$, $$$T$$$ — the interval at which Vitya approaches the scanner, the time it takes to scan one document, and the time until the end of the workday, respectively ($$$1 \leq t, k, T \leq 100$$$).
Output a single integer — the number of scanned documents.
4 5 17
3
5 5 20
5
If the scanning starts at time $$$L$$$, then the next scanning can be started at time $$$L + k$$$ or later.
If the time of the next approach to the scanner coincides with the end of the workday, Vitya first approaches the scanner and then goes home.
| Name |
|---|


