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.
13, 15, ['h', '4295', '7799', '9719', '991', '7773', '4045', 'W', '5143', '2705', 'U', 'h', 'H', 'c', '691', 'A', 'n', '5587']