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, 22, ['c', '3297', 's', 'm', '5531', 'k', 'G', '9439', 'b', '3817', 'O', '2963', '507', '4141', 'V', '3373', '2501', '3607', '3207', '5721', '9463', '1015', 'I']