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:
9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']

Ex Output:
25185


Ex Input:
2, 2, ['9797', '5585', '1849', '4485', '9225']

Ex Output:
5585


Ex Input:
6, 7, ['779', 'E', '4555', '8613', 'd', 'e', 'a', 'S', 'I', '4741', '2781', 'U', '95', 'i', 's', 'Z', '6161', '1165', '6639', '1581', '9427', 'E']

Ex Output:

0