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.
22, 24, ['d', 'I', '3131', 'l', '9621', 'J', '4465', '8241', 'B', 'X', 'H', '6095', 'd', '2665', '2313', 'E', 'b', 'X', 'E', '5973', '9747', '5411', 'Q', 'd']