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.
9, 13, ['8757', 'a', 'X', '3153', '8055', 'm', '2615', '1509', 'Z', 'I', '8051', 'l', 'Y', 'u', '4325', '3183', 'K', 'h', 'Z', 'o', 'G']