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, 13, ['1227', '6595', 'r', '7687', '3513', 'h', '1391', '4575', 'C', '3323', 't', 'c', '6623', 'Z', '3535', '8089', '2263', 'q', 'I', '8771', 'f', 'x', '3487']