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.
15, 25, ['y', 'M', 'N', '15', 'y', '5971', 'z', 'V', 'M', '4395', '3767', '9125', '8185', 'f', 'B', 'S', 'h', '9797', '331', 'j', 'P', 'F', '8681', 'T', '795', '4533', '9021']