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.
10, 12, ['R', '1629', 'x', '8553', 'K', '2697', '1841', '4567', '1299', 'k', '9449', 'r', '607', 'W', '3845', '7915', 'p', '803', '1153', 'O', '5459', 'z', '4941', 'r', '8833', '3047', '9523', 'e']