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, 4, ['h', 'w', 'L', 'L']

Output: 0


Input: Consider Input: 6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']

Output: 28446


Input: Consider Input: 7, 10, ['E', '6279', '9335', '5481', 'U', 'A', '4829', 'M', 'Y', 'r', '6045', '8655', '9485', 'y', '4379', 'H', '4741']


Output: 4829