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.

Input: Consider Input: 2, 5, ['9153', 'S', '605', '2951', 'I', 'o', '4995', '2895']

Output: 3556


Input: Consider Input: 1, 11, ['5355', 'C', 'U', '7363', 'A', 'F', '2893', 'L', 'q', '8973', '8853', '9297', 'v', 'z', 'u', '1227', 'J', '5333', '2515', '6461']

Output: 33437


Input: Consider Input: 1, 9, ['j', '6683', '6103', '7609', 'H', '1863', '1037', 'N', '9415']


Output: 32710