{"raw_statement":[{"iden":"statement","content":"You are given a sequence of signed 64-bit integers defined as follows: \n\nLet's call a sequence element xp _repeatable_ if it occurs later in the sequence — meaning that there exists such q, q > p, that xq = xp. The _first repeatable_ element M of the sequence is such an element xm that xm is _repeatable_, and none of the xp where p < m are _repeatable_.\n\nGiven A, B and C, your task is to find the index of the second occurrence of the _first repeatable_ element M in the sequence if the index is less or equal to 2·107. Per definition, the first element of the sequence has index 0.\n\nThe only line of input contains three signed 64-bit integers: A, B and C (B > 0, C > 0).\n\nPrint a single integer  — the index of the second occurence of the _first repeatable_ member if it is less or equal to 2·107. Print  - 1 if the index is more than 2·107.\n\nIn the first sample test the sequence starts with the following numbers: 1, 3, 7, 6, 3, 7. The _first repeatable_ element is 3. The second occurence of 3 has index 4. \n\nIn the second sample test the sequence starts with the following numbers: 1, 2305843009213693951, -4611686018427387903, 6917529027641081855, 0, 0, 0. The _first repeatable_ element is 0. The second occurence of 0 has index 5. \n\nIn the third sample test the sequence starts with the following numbers: 1, -2, 4, -3, 1, -2, 4. The _first repeatable_ element is 1. The second occurence of 1 has index 4.\n\n"},{"iden":"input","content":"The only line of input contains three signed 64-bit integers: A, B and C (B > 0, C > 0)."},{"iden":"output","content":"Print a single integer  — the index of the second occurence of the _first repeatable_ member if it is less or equal to 2·107. Print  - 1 if the index is more than 2·107."},{"iden":"examples","content":"Input2 2 9Output4Input2305843009213693951 1 9223372036854775807Output5Input-2 1 5Output4"},{"iden":"note","content":"In the first sample test the sequence starts with the following numbers: 1, 3, 7, 6, 3, 7. The _first repeatable_ element is 3. The second occurence of 3 has index 4. In the second sample test the sequence starts with the following numbers: 1, 2305843009213693951, -4611686018427387903, 6917529027641081855, 0, 0, 0. The _first repeatable_ element is 0. The second occurence of 0 has index 5. In the third sample test the sequence starts with the following numbers: 1, -2, 4, -3, 1, -2, 4. The _first repeatable_ element is 1. The second occurence of 1 has index 4."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ N, X, Y \\in \\mathbb{Z}^+ $ denote the number of PCs, Moath’s setup time per PC, and Saif’s setup time per PC, respectively.\n\n**Constraints**  \n$ 1 \\le N, X, Y \\le 10^9 $\n\n**Objective**  \nFind the minimum time $ T \\in \\mathbb{R}^+ $ such that there exist non-negative integers $ a, b $ with $ a + b = N $, satisfying:  \n$$\na \\cdot X \\le T \\quad \\text{and} \\quad b \\cdot Y \\le T\n$$  \nEquivalently, minimize $ T $ subject to:  \n$$\n\\left\\lceil \\frac{a}{N} \\right\\rceil \\cdot X \\le T, \\quad \\left\\lceil \\frac{b}{N} \\right\\rceil \\cdot Y \\le T, \\quad a + b = N, \\quad a, b \\in \\mathbb{Z}_{\\ge 0}\n$$  \nThe minimal $ T $ is:  \n$$\n\\min_{a=0}^{N} \\max\\left(a \\cdot X, (N - a) \\cdot Y\\right)\n$$","simple_statement":"Moath and Saif are setting up N computers. Moath takes X minutes per computer, Saif takes Y minutes per computer. They work simultaneously on different computers. What’s the minimum time needed to set up all N computers?","has_page_source":false}