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, 17, ['1371', 'U', 'c', '3563', '5631', '1799', 'I', 's', '4377', 'l', 'h', 'J', 'L', '6543', '9681', 'l', 'G', 'u', '2765', '3647', '7425', '8861', 'y', '9963', '4535']