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.
7, 29, ['f', '5603', '3639', '1583', '4565', 'm', 'N', '1193', 'K', 's', '6347', 's', 'b', 'H', '5895', '425', '9109', '4055', '9517', 'S', '4259', '9415', 'C', 'D', '785', '851', '953', '5849', '1985']