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: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
Example Output: 23119

Example Input: 1, 6, ['8527', '3499', 'M', 'f', 'V', 'B']
Example Output: 12026

Example Input: 5, 11, ['o', '7521', 'I', 'a', '5053', '4849', 'I', '6861', '4461', '1453', '8103', 'n', 'x', 'L', '5785', 'x', 'd', '9067', '629', '1841', 'N', 'S', 'H', '7507', 'O', 'L']
Example Output:
30780