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: 13, 17, ['Q', '5289', 'c', '4899', '6689', '4415', '6359', '9115', 'g', 'G', '4839', '7981', '1731', 'S', 'C', 'w', '9743', '3391', 'w']

11474