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.
3, 19, ['n', '8375', '8735', '3927', 't', 'u', 'K', '5177', '6325', '2647', 'B', 'm', 'f', 'c', '669', '9621', 'J', 'g', '3747', '5621', 'd', '4649']