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.
21, 22, ['w', '5787', '6553', '7761', '6467', 'L', '1785', 'U', 'Q', 'J', '6481', 's', '8141', 'v', 'A', '2913', 'a', '9425', 'O', 'y', '8575', '2071', '9083', '1485']