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, 4, ['4845', '7313', 'P', 'A', '2285', 'C', 't']
Example Output: 0

Example Input: 15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']
Example Output: 34357

Example Input: 1, 9, ['Z', '1599', 'I', '725', 'X', 'd', '4255', 'l', '2505', 'a', 'C', '4783', 'g', 'e']
Example Output:
9084