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.
4, 21, ['M', '809', 'A', '6617', 'L', 'w', 'A', '8121', '4325', '7259', 'P', '5867', '5721', 'p', '5015', 'G', 'Z', 't', 'w', '6469', '2721', '5469', 'D', 'I']