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, 13, ['6739', 'H', '8045', '3123', '7531', 'n', '371', '8199', 'w', '3195', 'w', 's', '3939', 'i', '6947', 'm', 'O', 'j', '333', 'n', '6333']