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, 9, ['c', 'm', 'H', 'x', '5941', '3421', '4951', 'Q', 'h', '101', '329', 'R', 't', '4583', '1997', 'l', 'W', 'M', '9795', '2171']