In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

Ex Input:
2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']

Ex Output:
9829


Ex Input:
13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']

Ex Output:
1667


Ex Input:
13, 14, ['7067', 'c', '6209', '8251', '8859', 'u', 'm', '853', 'w', '2519', 'V', 'z', 'q', 'A', '5201', 'o', 'X', 'P', 'R', '4313', '8855', '6493', '5199', '6201', '3493', '6213', '2463', 'r', 'n', 'B']

Ex Output:

0