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.
1, 12, ['z', 'f', 'e', 'f', '9019', 'X', '5809', '5489', '5937', '7083', '5189', '8729', '2989', 'o', '5147', '6837', '4205', 'C', '5199', 'j', 'U', '4685', 'p', 'y', '6835', '4927']