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:
3, 5, ['u', 'Y', '4165', '1421', '7617']

Ex Output:
13203


Ex Input:
1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']

Ex Output:
28546


Ex Input:
1, 5, ['I', 'd', 'd', 'g', 'U']

Ex Output:

0