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.
5, 11, ['6485', '1335', '5553', '8205', 'C', '5777', '1229', 'b', 'y', 'u', 'G', 'n', 'R', '3039', 'Q', 'N', 'o', '8527', 'Q', 'Z', 'M', 'L', 'z', 'k', 'j', 's', '1109', '4591', '5007']