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.
25, 28, ['u', '9225', 'U', '8703', 'V', 'A', 'y', '8273', 'T', 'I', 'W', '8137', 'U', 'B', '1793', 'N', 'x', 'K', 'T', 'e', '3661', 'P', '2951', '5259', '903', 'X', 'V', 'z']