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, 15, ['9317', '1595', '8045', '5997', 'f', '5079', '5533', 'H', '9043', 'Y', 'F', '1347', '9339', '1809', 'r', '7417', 't', '557', 'P', '8175', '6857', 'v', '9821', 'x', '4443', '83']