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.
18, 22, ['f', '9501', 'y', 'k', '1483', 'H', '9495', 'D', '1099', '4039', '1265', 'm', 'i', '3081', 'k', '2569', 'c', 'V', 'n', 'o', 'z', '5317', '5875', '2425', 'k', '1609', '9609']