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: 3, 10, ['r', 'A', 'l', '7169', '3249', 'T', 'O', 'g', 'F', 'M', 'R', '171', 'M', '2449', '3749', 'f']
Example Output: 10418

Example Input: 1, 3, ['g', 'g', 'K']
Example Output: 0

Example Input: 12, 25, ['1229', '2051', '6647', 'k', '1997', 'c', '9663', 'I', 'B', 'h', '7747', 'i', '1769', '865', 'o', '6733', 'r', 'C', '301', 'g', 'M', 'L', 'T', 'H', '5815', '3303', 'R']
Example Output:
15483