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.
11, 19, ['c', '3489', 'K', 'a', '8387', '4561', 'C', '6069', '4959', '4015', 't', '4601', 'F', 'E', '7657', '8243', 'k', 'N', '7961', 'K', '5897', '7013', 'G', '2879']