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: 6, 11, ['o', 'K', '9851', 'C', '3251', '1563', 'x', 'a', '627', '959', 'r', 'q', '7513', 'r', '1921', '2269', 's', '9941', 'e']

3149