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, 11, ['s', 'z', '2731', 'N', 'O', '5991', 'U', '5333', 'l', 'K', '6727', 'j', '9249', 'l', 'v', 'c', 'W', 'C', '9771', '4935', 'u', '3565', '4039', '8329', 'b', 'g', '9735']