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.
11, 11, ['X', '6381', '7641', '6189', '6537', '8599', 'Q', 'u', 'h', 'T', '6505', '8539', '1645', 'v', 'm', '1267', 'b', '1683', 'Z', 'm', 'C', 'C', '1875', '7653']