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, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']
Example Output: 9771

Example Input: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
Example Output: 0

Example Input: 4, 8, ['V', 'd', 'c', '9255', 'A', '2017', '4525', '4237']
Example Output:
20034