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: 2, 17, ['t', 'f', '2813', 'B', '2877', 'z', '4007', 'b', 'H', '479', 'W', 'Q', 'z', '3289', 'g', '5237', '4397', '123', '5487', '891', '6111', 'V', 'B']

23099