Sum of Multiples of 17 in a Range

Given two positive integers m and n (with 0 < m < n < 1000), compute the sum of all the numbers between m and n (inclusive) that are divisible by 17. The divisibility condition is mathematically represented as: $$ x \equiv 0 \pmod{17} $$, where x is any integer in the range.

inputFormat

The input consists of a single line containing two integers m and n separated by a space.

outputFormat

Output a single integer which is the sum of all numbers between m and n that are divisible by 17.

sample

1 100

255