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: 9, 11, ['C', 'f', '1915', 'u', 't', '3557', 'T', 'Y', 's', 'Q', '7973', 'G', '7131', '8159', '7079', 'b', '7465', '4795', 'X', '5295', 'c', 'u']

7973