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, 15, ['Q', 'j', 'q', '8943', 'Y', 'p', '5525', '1893', '633', '5263', '7175', '4069', '4133', '3217', '9695', '621', '8685', '6961']

33552