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.
6, 12, ['u', 'v', '4581', 'V', 'M', 'a', '8295', '8465', 'W', '3961', '1723', '1541', 'a', 'a', 'R', 'x', '4271', 'S', '3169', 'l', '2573', '1597', 'q', '5057', 'j', '6395', 'c', 'Y']