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.
19, 30, ['P', 'U', 'U', '3341', 's', '8125', '5389', 's', 'L', '6859', 'b', '8785', '8399', 'i', '7067', 'A', '95', '1033', 'J', '8709', 'N', '5595', '5983', 'm', '6777', '1623', 'N', 'J', 'I', '9557']