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.
12, 12, ['l', '4757', 'l', 'z', 'n', 'N', 'B', 'i', '2063', 'e', '6301', 'G', '4633', 'n', 'r', '5517', '9099', '3565', 'K']