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.
23, 26, ['o', 'U', '3003', '6499', 'r', '8541', 'Q', 't', 'x', '8307', 'N', 'M', '7405', 'Y', '4529', 'T', 'd', '3907', 'z', 'U', '8273', 'q', 'Z', '3741', 'Z', 'h']