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.
7, 8, ['3123', 'W', '2511', '8845', '1723', '381', '2317', 'p', 'Q', '477', 'G', 'o', '5389', 'y', 'p', '515', '6803', '8587', '1851', 'U', '7901', 'k', 'I', 't', 'q', 'b', 'D']