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.
3, 12, ['641', '6641', '4165', 'N', '3143', '6011', '8593', 'Y', 'S', '8253', 'M', '1787', '425', '5213', 'Z', 'D', 'B', 'j', 'G', '2045', '4459', '5663', '5567', 'J', 'l', '8689', '1391', 'F']