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.
2, 20, ['r', 'g', 'w', '979', 'J', 'F', '2891', 'L', '2109', '3251', '5413', '2497', 'S', 'Q', '8015', 'F', 'O', '5495', '8641', 'r', '9863', 'A', '2535']