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, 15, ['M', '7941', 'H', 's', '1769', 'p', '3367', '9431', '2661', 'v', 't', 'o', '3249', 'U', 'y', '6977', 'U', '4787']