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.
4, 11, ['7987', 'w', 't', '3739', '3339', 'A', '2815', 'h', 'y', '2865', '779', '7491', 'C', 'j', 'X', '603', '9205', '7227', 'f', 'd', 'g', 'L', '8661', 'O']