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: 1, 6, ['B', 'X', 'o', 'J', '6315', '5685', 'M', '4103', '7101', '6261', '8967', '7331', '9571', '1553', 's', '6923', '3751', 'y', 'C', '3565', 'T', 'H', 'u', '1097', '7797', 'k', '7535', 'G', 'F', 'D']

12000