### Problem Statement

In some of the old historical chronicles the Indict system of chronology was used. Instead of a year, this system uses three integers, called indict, circle to the Sun, and circle to the Moon. Let's denote them as indict, circleSun, circleMoon.

Each of these three integers has a unique range. indict is between 1 and 15, circleSun is between 1 and 28, and circleMoon is between 1 and 19 (all ranges are inclusive). Initially, at year 1, all three of these numbers are equal to 1. Every year, all three numbers increase by 1, and whenever a number exceeds its upper bound (15, 28, and 19, respectively), it is reset to 1. For example, in year 16, indict = 1, circleSun = 16, and circleMoon = 16.

Given the ints indict, circleSun, and circleMoon, return the earliest year that the three numbers can represent. Time starts at year 1, so the return value will never be less than 1.

### Definition

 Class: IndictDates Method: getYear Parameters: int, int, int Returns: int Method signature: int getYear(int indict, int circleSun, int circleMoon) (be sure your method is public)

### Constraints

-indict will be between 1 and 15, inclusive.
-circleSun will be between 1 and 28, inclusive.
-circleMoon will be between 1 and 19, inclusive.

### Examples

0)

 `1` `16` `16`
`Returns: 16`
 This is the example from the problem statement.
1)

 `1` `1` `1`
`Returns: 1`
 Initially we are at year 1.
2)

 `1` `2` `3`
`Returns: 5266`
3)

 `15` `28` `19`
`Returns: 7980`

#### Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=6515

#### Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=10064&pm=6515

Pawa

#### Testers:

PabloGilberto , brett1479 , Olexiy

#### Problem categories:

Brute Force, Math