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: 3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Output: 22632


Input: Consider Input: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']

Output: 123


Input: Consider Input: 1, 9, ['9999', '9927', 'F', 'o', '6219', 'Q', 'i', 'r', 'Z', '8469', 'n', 'A', '6439', 'H', '6125', '6577', '8639', 'X', 'C', 'm', '4707', 'W', '1085', 'y', 'y', 'Z', '2319']


Output: 26145