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, 21, ['9391', '3721', 'B', 'Z', '2035', 'g', '8113', 'l', '1219', 'q', '4433', 'i', 'D', '3033', 'z', 'Y', '5435', 'V', '4607', 'v', 'U']