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, 23, ['7927', 'E', 'S', 'F', '4523', '6757', 'K', '1631', 'U', '815', '4097', '9565', '9147', '9563', '7827', 'y', 't', 'n', 'M', 'j', '5201', 'Q', '6935']