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, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']

Ex Output:
4866


Ex Input:
2, 2, ['R', '979', 'H', 'W', 'y']

Ex Output:
979


Ex Input:
9, 12, ['7763', '1481', 'd', '5827', 'g', '4989', '4779', '4329', '1479', '375', '5051', '3437', '1023', '5571', '1683', '6757', 'r', '3919', '5315']

Ex Output:

10342