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, 20, ['Z', '8141', '9923', 'X', '1689', '561', '5279', '8905', 'b', '6449', '2043', 'm', '1217', '857', '2335', '925', '4745', 'g', 'X', 'J', 'm', 'j', 'V', '5191', '6257']