beecrowd | 1132
# Multiples of 13

**Timelimit: 1**

Adapted by Neilor Tonin, URI Brazil

Write a program that reads two integer numbers X and Y and calculate the sum of all number not divisible by 13 between them, including both.

The input file contains 2 integer numbers X and Y without any order.

Print the sum of all numbers between X and Y not divisible by 13, including them if it is the case.

Input Sample | Output Sample |

100 |
13954 |