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.
8, 12, ['D', '135', '4341', '8775', '8941', 'H', 'y', 'O', 'L', '49', '6113', '5475', '6785', 'g', '5543', 't', '613', '6145', '9717', '81', 'L']