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.
6, 13, ['w', '4105', '8779', '8645', 'm', '9197', '415', '2535', 'R', 'B', '7467', 'h', '9733', 'X', '6271', '4821', 'N', 'U', '3789', 'u', 'b']