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.
2, 16, ['W', '291', 'M', '7735', '8167', '3577', '4155', '7367', '9199', 'e', 'C', 'a', '6239', 'c', '4305', '227', '6467', '3809', 'X', '9867', 'E']