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, 13, ['5449', 'D', '8427', 'O', 't', 'B', '3929', 'E', 'R', '181', '941', '6463', '7695', '3701', '7003', 'b', 'A', 'o']