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.
3, 23, ['D', 'C', 'n', '259', 'a', 'N', 'w', '7559', '9201', '2081', 'm', '6609', '447', '3429', 'd', '4073', '2397', 'k', '5111', '923', '3769', 'm', '117', '2017', '4437']