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: 21, 27, ['8879', '8245', 'i', 'Q', 'k', 'y', 'e', '1631', '7905', '6025', 'R', 'x', '9991', 'g', 'z', 'd', '2825', 'w', 'H', '5435', 'j', '3211', '7751', '6339', '1965', '7421', 'y', '9201', '8207', '2085']

26687