Definition: 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.
Input: 10, 17, ['J', 'T', 'c', '3457', 'K', '9371', '1361', 'w', 'H', 'I', '2229', '7773', '8239', 'r', '1181', '7693', 'Q', 'T', '729', 'x']

27115