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.
1, 11, ['x', '6883', 'f', '457', '207', 'p', 'J', 'j', '8007', '3495', 'M', 'E', '4859', 'R', 'V', '2261', 'a', 'e', '6959', '2347', '683', 'L', '1469', 'U', 'h', 'I']