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: 4, 15, ['9021', '2343', '1041', '131', '9027', 'Q', 'v', 'j', '9391', '653', 'p', 'L', '4653', '6163', 'H', 'x', 'N', 'u', 'f', 'L', '6035', 'C', '5355', 'e']
Example Output: 30018

Example Input: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']
Example Output: 20962

Example Input: 2, 9, ['G', 'b', 'M', 'h', '9405', 'U', '3751', 'K', 'C', '685', 'e']
Example Output:
13156