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, 20, ['z', 'L', 'D', 'G', '1547', '8885', 'M', 'F', 'e', 'Z', '4011', '6795', '6165', 'o', 'y', 'L', 'g', 'Q', '4245', '7279', '2543', 'p', '1331', '9805']