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: 7, 19, ['G', 'r', 'u', 'e', 'O', '7983', '4733', '5333', '8511', 'q', '6343', 'z', 'n', 'd', '1511', 'f', '6681', 'X', 'v', '6725', '6501', '8771', '6245', 'A', 'a', '8337', '1885']

33112