Codeforces Round #395(Div. 2)A. Taymyr is calling you【水题】

A. Taymyr is calling you

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Comrade Dujikov is busy choosing artists for Timofey's birthday and is recieving calls from Taymyr from Ilia-alpinist.

Ilia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on. The day is z minutes long, i.e. the day consists of minutes 1, 2, ..., z. How many artists should be killed so that there are no artists in the room when Ilia calls? Consider that a call and a talk with an artist take exactly one minute.

Input

The only string contains three integers — n, m and z (1 ≤ n, m, z ≤ 10⁴).

Output

Print single integer — the minimum number of artists that should be killed so that there are no artists in the room when Ilia calls.

Examples

Input

1 1 10

Output

10

Input

1 2 5

Output

2

Input

2 3 9

Output

1

Note

Taymyr is a place in the north of Russia.

In the first test the artists come each minute, as well as the calls, so we need to kill all of them.

In the second test we need to kill artists which come on the second and the fourth minutes.

In the third test — only the artist which comes on the sixth minute. 

题目大意：

一共有Z分钟，电话来的时间为n，2n，3n....................人来的时间为m，2m，3m...............问需要去除多少人才能使得人来的时候没有电话来。

思路：

因为Z比较小，那么直接暴力即可。

当然如果你比较喜欢求LCM，没人拦着。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
    int n,m,z;
    while(~scanf("%d%d%d",&n,&m,&z))
    {
        int cnt=0;
        for(int i=1;i<=z;i++)
        {
            if(i%n==0&&i%m==0)
            {
                cnt++;
            }
        }
        printf("%d\n",cnt);
    }
}