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.

Example Input: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']
Example Output: 17181

Example Input: 11, 15, ['S', 'F', 'q', 'r', 'X', '2063', '9327', 'R', 'T', 'B', 'j', 'b', 'T', 'X', '3469', 'E', '2177', '8143', 'U', 'Z', '8007', '4991', 'v', 'm', 'f', '7173', 'N', '2449', '2291']
Example Output: 3469

Example Input: 3, 9, ['3149', 'B', 'l', 'y', '1423', '2403', 'H', '8753', 'j', 'J', '3099', '1661', 'F', 'S', 'O', 'g', 'l', 'K', 'Z', '8689', '9093']
Example Output:
12579