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.
5, 6, ['j', '4081', '6191', 'd', '3569', '6945', '3951', '1615', 'x', '587', 'N', 'J', '4017', '6897', 'l', 'o', 'F', 's', '6675', '8917', 'F', 'w', 'c', '3713', 'D', 'N']