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: 5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

Output: 4571


Input: Consider Input: 9, 17, ['9485', '5729', 'N', 'v', 'H', 'j', 'K', 'D', 'R', '2515', 'O', '2001', '9877', 'p', 'Y', '8407', '647']

Output: 23447


Input: Consider Input: 8, 13, ['G', 'q', 'F', 'j', 'b', 'n', '7583', '3801', '3261', '4273', 'a', '6147', '6023', '4703', 'b', 'C', '4025', 'f', '2613', '2229', 'v', 'H', '4737', 'N', '605', 'M']


Output: 23505