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.
13, 15, ['6611', '7561', 'i', 'q', '8845', 'l', 'j', '4839', '1743', '7385', 'h', 'v', '5453', '6665', '3611', '2005', 'A', '5997', 'I', 'Y']