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, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']

Output: 30904


Input: Consider Input: 19, 23, ['8277', '3337', 'G', 'N', '2365', 'S', 'Y', 'l', '5871', '2373', '7441', '2095', 'N', 'J', 'Q', '5493', 'Q', 'g', 'E', 'i', '4825', '5543', 'i', '1737', 'y', '1463', 'r', 'F']

Output: 10368


Input: Consider Input: 6, 9, ['s', '325', 'u', 'm', 'e', 'f', '6689', 'l', '2587', 's']


Output: 9276