Given the task definition, example input & output, solve the new input case.
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.
Example: 3, 7, ['A', '23', '7413', '6933', '3369', '807', 'M', '456']
Output: 18522
Here, the numbers from 3rd to 7th position are '7413', '6933', '3369', and '807', hence their sum (7413+6933+3369+807) is 18522.

New input case for you: 3, 6, ['9413', 'f', '2413', '6025', 'O', 'y', 'L', 'y', 'j', 'd', 'B', 'm', '9177', '8729', '4439', 'L', '3277', '1557', '9259', '8015', '9125', '1019', '3039', '1275', '7343', 'A']
Output:
8438