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.
9, 26, ['X', '1593', '8327', '5021', 'l', 'M', 'n', 'd', 'n', 'Z', '693', 'C', 'z', '875', 'h', 'g', 'R', '2753', 'L', '2301', '3679', '6991', 'x', '2591', 'j', '1039']