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.
6, 19, ['2207', '9047', '3429', '9511', 'm', 't', '8153', 'a', '6805', '1773', 'E', 'q', 'L', 'c', 'l', 'C', '6553', 'z', '4381', '5827', '3011']