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:
1, 1, ['D', 'W', '5783']

Ex Output:
0


Ex Input:
2, 4, ['X', 'o', '8807', 'r', 'q', '825']

Ex Output:
8807


Ex Input:
3, 8, ['149', 'g', 'V', '9889', 'W', '1187', '3891', '9639', '1857', 't', '5195', 'P']

Ex Output:

24606