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, 20, ['C', 'L', 'z', 'l', '131', '4175', '5541', '6569', '6101', 'G', '8475', '7085', 'V', 'H', '7303', '1971', 'c', 'J', 'f', '6205']