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.
1, 1, ['B', 'E', 'h', '7229', 'y', 'I', 'F', 'P', '2051', '6453', 'W', 'l', 't', 'U', 'O', '9135', 'L', '1165', 'O', '907', '4457', 'w', 'W', 'M']