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.
2, 13, ['w', '2577', 'a', 'A', '5917', 'i', 'H', 'p', '6903', '9545', 'f', '3715', 'a', 'e', '4343', 'U', '1935', 'K', 'g', '2827', '3341', '6391']