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, ['o', 'F', 'G', 'z', '1315', 'r', '1155', '3953', 'I', '1037', 's', '4753', 'l', 'b', 's', '2039', 'D', '2969', '1939', 'Z']