Confidence Restoration Challenge

When two coders, Zero and Mike, decide to team up, their combined efforts not only solve challenging problems but also restore their confidence. In their routine, each problem is originally assigned a difficulty value \( hard \) by Mike. With the encouragement of their friend BookCity, the difficulty slides down a bit, becoming \( \max(1, hard - d) \). However, an interfering magician named Guy may suddenly multiply the difficulty by \( s \) as soon as they finish a problem, while the wise teacher tingtime can sometimes reduce the difficulty to a very low threshold.

Despite the chaotic adjustments in difficulty, Zero and Mike are perfectionists: they only attempt a problem if they are confident about solving it within their common talent range \( Talent \). When they correctly solve a problem, they each gain 300 points, adding up to a total of 600 confidence points per problem solved.

Your task is straightforward. Given that they solve consecutive problems from the \( a^{th} \) problem to the \( b^{th} \) problem, compute the total confidence value they restore. Formally, if they solve \( k \) problems successfully, then the total confidence restored is given by:

[ Confidence = 600 \times k \quad \text{where} \quad k = b - a + 1. ]

Note: Although the narrative includes various adjustments to problem difficulties, in this challenge, you only need to calculate the above formula based on the problem range provided.

inputFormat

The input consists of a single line containing two space-separated integers a and b, where \(1 \leq a \leq b\). These represent the starting and ending indices (inclusive) of the problems solved.

outputFormat

Output a single integer which is the total confidence points restored, calculated as \(600 \times (b - a + 1)\).

sample

1 1

600