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.
10, 27, ['U', '2087', '5637', '9917', '5683', '953', '107', 's', '5801', '81', 'g', '911', 'T', '593', '1565', '3847', '517', '9977', 'S', '6361', 'v', '2633', '6003', '6123', 'm', '4999', 'x', '999', '5235', 'M']