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.
7, 19, ['1981', '4251', '8893', 'T', 'Z', '8191', '4183', '9087', 'i', '2913', 'w', 'I', '5629', 'G', '1685', '8125', 'W', 'q', 'R', 'h', '4509', 'M', 'l', 'K']