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: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']

Output: 0


Input: Consider Input: 4, 10, ['1081', 'm', 'm', '489', '9481', '5741', '1049', 'p', 'd', '7785', 'm', '4905', '1343', 'A', '9931', 'C', 'v', 'l']

Output: 24545


Input: Consider Input: 3, 6, ['D', 'U', 'Y', 'a', '4145', 'h', '2505', '821', '5283', 'B', 'q', 'e', '3003', 'b', '9149', '6521', '7465', 'u', 'B']


Output: 4145