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.
11, 12, ['5711', 'D', 'i', '9859', 'Z', 'g', '5943', 'X', '7095', 'Y', '1671', 'h', '7729', 'R', 'a', 'm', '8277', 'Q', '3215', 'A']