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.
22, 28, ['b', 'O', 'R', 'A', 'm', 'R', '8633', '9253', '555', 'Q', '9375', '6303', 'P', '9877', '4633', 'd', '2003', '6209', '5207', 'a', 'I', '9253', 'c', '2095', '3201', 'u', 'c', '7127']