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, 11, ['G', 'o', 'U', 'Q', 'J', '6495', 'z', '2903', '3557', 'p', '7351', 'v', 'q', '1591', '245', 'f']

20306