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, 8, ['n', 'm', 'M', 'j', 'B', '9677', '8325', 'S', '6495', '4709', '1509', 't', '9241', '253', '9653', '5301', '8607', 'j', 'i', 'y', '6991']