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.
8, 11, ['9207', '3567', 'H', 'm', '9615', 'w', '1943', '6897', '1529', 'j', 'x', '4711', 'x', '8107', '7433', '5603', 'g', '1887', 'm', '5279', '9181', 'R']