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, 21, ['s', 'D', '5241', 'L', '9101', '1911', 'E', 'M', '7883', 'K', '5855', '1671', '7129', '2367', '2503', 'H', 'G', 'h', 'o', '2255', '3165', '5499', 'E', '9565', '5529']