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, 21, ['w', 'y', 'W', 'j', 'n', 't', 'e', '2941', '777', 'C', '973', '5181', '2821', '5695', '973', '3935', 'W', '2327', '2907', '8631', '2577', 'p', '3319', '4767', 'I']