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, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']

Output: 9829


Input: Consider Input: 4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']

Output: 22271


Input: Consider Input: 1, 12, ['H', 'X', '823', 'm', '5151', 'f', 'J', 'H', '4539', 'K', '5629', 'Y', '3657', '8467', 'x', 'Z', '499', 'R', '4085', 'd', 'S', '2137', '7191', '2137', '9397', '4997', 'X', 'V']


Output: 16142