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.
9, 15, ['1789', 't', 'R', '271', 'Q', 'x', '2871', 'l', 'w', 'O', 'q', '9837', 'Q', '8713', 'Q', 'L', 'O', '2925', 'F', 'Z', 'L', 'M', 'L', '3865', '9313']