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.
18, 18, ['n', 't', 'z', '3877', 'U', 'j', '8867', 'R', 'r', '3041', 'v', '6219', '633', 'b', 'R', 'Q', '7519', '1833', '1123', 'h', '1521', 'l', '9511', 'c']