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 Input: 9, 9, ['y', '689', 'X', 'X', 'u', '1839', '8779', 'O', 'O', 'A', '1559', 'A', 'U']
Example Output: 0

Example Input: 10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']
Example Output: 12585

Example Input: 1, 17, ['1839', '4935', 'F', 'x', 'C', 'V', 'm', '5641', 'y', 'g', 'D', '5571', 'w', 'L', '61', 't', 'J', '4029', 'k', 'X', 'K']
Example Output:
18047