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.
12, 19, ['D', 'z', '195', 'm', '8597', 'h', '6265', '8327', 'q', '2063', '4053', '9583', '7675', '7095', '575', 'U', '6877', 'Y', 'F', 'D', '3409']