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: 17, 25, ['J', 'U', '1779', 'B', 'H', '5563', 'E', 'T', '7207', 'q', 't', 'E', '1553', '6503', '2525', '4829', '1649', '8741', '5621', 'f', '7543', 'W', '9731', 'L', '5573', '9471', 'G', '59', 'B', 'I']

38858