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: 19, 27, ['b', 'D', '3619', 'J', 'r', 'T', 'u', '8771', 'j', 'E', '643', 'R', 'v', '329', '373', '9471', '1147', '3337', 'I', 'd', 'z', 'q', '2141', '4761', '3991', '5327', 't', '9215', 'n']

16220