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, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']

Ex Output:
16174


Ex Input:
2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']

Ex Output:
9180


Ex Input:
1, 9, ['8949', '273', 'f', 'K', 'C', '2573', '3747', 't', 'T', '181', 'v', 'Z', '7847', 'D', '7847', 'L', 'z']

Ex Output:

15542