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.
9, 10, ['1591', '79', '4557', 'J', 'R', 'A', '1063', 'p', 'o', 'u', '9173', '953', 'c', '7631', '9499', '251', 'S', 'S', 'n', 'K', 'J', '3117', 'Q', '8707', '2291', '8971', '8203', 'U', '779']