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.
20, 22, ['Y', 'z', '2117', 'p', 'C', 'U', '9573', '2417', 'z', 'H', '7667', '659', 'F', '9057', '8329', 'I', '987', 'i', '3007', 'e', 'I', '231', 'z', 'L', '2925', 's', '2459', '8225', 'W']