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.
9, 11, ['9231', '2989', '675', '403', 'V', 'r', '2913', 'l', '1975', 'A', '6861', '4025', '8993', 'h', '4983', '1585', '6135', '6617', '3097', 'R', '5279', '8121', '9975', 'r', '2607', 'U', 'T', '2157', 'Z']