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.
3, 23, ['l', '4695', '7165', '1217', 'M', 'd', '845', 'z', '1815', 'j', 'O', 'm', 'c', '1785', 'O', '6317', 'V', '323', '8147', 'C', '4661', '8885', '5217', 'i', '5187']