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.

8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']
3932

5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']
4383

3, 8, ['Y', 'T', '5325', 'X', 'E', '7585', '9115', 'y', 'l', 'I', 'B', '4059']

22025