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, 6, ['n', 'J', '8299', 'D', '33', 'E', 'D', '3199', '955', '2717', 'T', 'e', '1747', '1961', 'O', '4117', '6315', '9439', '7467', '3715', 'j', '3203', 'M', '9231', 'U']