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: 1, 17, ['t', '789', 'B', 'l', 'c', '8813', '3779', '1525', '5025', 'q', 'j', '4503', 'w', '8847', 'L', 'K', '5079', 'm', 'e', 'd', 'U', '1085']

38360