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.
12, 13, ['521', '8595', 'O', 'z', '2067', 'r', '7315', '5915', '5653', 'n', 'j', 'l', '4037', 'k', 'p', 'M', 'E', 'G', 'K', '8075', 'C', '8763']