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.
8, 12, ['5229', 'V', 'o', '5007', 'r', '5781', 'q', 'C', 'R', 'X', 'd', 'C', '313', 'q', '9733', 'Q', 'h', 'L', '6643', 'E', 'd', 't', '73', '2987', '6055', 'i', 'h']