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: 5, 11, ['8801', 'M', '6509', 't', '3867', '5631', 'b', '1849', '855', '7633', 'G', '8525', 'k', '9499', 'w', 'd', 'Q', '2573', 'A', 'Y', '201', 'X', 'W', 'h', '6793', '547', '9873', '7439', 'g', 'c']

19835