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, 27, ['7781', 'd', 'p', '8661', '6915', '2215', '3039', '8311', 'i', 'g', 'U', '979', 'F', 'H', 'U', 'g', '4551', '5047', '5921', '7079', '9461', 'C', 'g', '7185', '2321', 'H', '445']