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: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
Example Output: 5085

Example Input: 3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']
Example Output: 40356

Example Input: 2, 3, ['Z', 'S', '9445', 'Q', '2871', '9299', 'b']
Example Output:
9445