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.
2, 15, ['l', 'U', 's', 'G', '531', '4105', '3455', '6761', '5437', 'K', 'O', 'l', 'W', '9653', '925', '351', '607', 'h', '8507', 'E', '721', 'i', '9773', 'l', 'C', 'M', '9559']