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.
22, 24, ['y', '6161', 'i', 'd', '9575', 'n', '9807', '8735', '1151', '7185', 'V', 'w', 'Q', 'K', '8091', '1869', 'b', 'H', 'M', '985', 'i', '3109', '2367', '3061']