Definition: 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.
Input: 5, 15, ['e', 'w', 'I', 'G', '6935', 'Q', '9461', '7025', '7323', '6781', 'R', '1167', 'g', '2201', 'u', '6595', 'x', '6115', 'x', '6279', 'h', 'J', '5389', 'f', 'N', 'o', 'f', 'u', 'H', '4041']

40893