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.
6, 19, ['4109', 'X', 'h', '3495', '7089', '9221', 'o', 't', 'b', 'q', '5991', '9513', 'E', 'z', '2465', '1723', 'P', '9489', 'Y', 'o', 'F', '4117', '7545', 'V', '1503', '1283', '5595', 'H', '5533', 'c']