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, 21, ['4313', '7891', 'B', '4703', 'w', '6705', 'P', 'M', '9717', 'y', 'L', '9889', '8371', 'S', '1065', '4237', '1607', '455', 'Y', '3195', '6509', 'y', 'n', 'V', '6667', '9779', 'm', 'n', 'v']