Definition: 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.
Input: 5, 11, ['5181', '8749', 'z', 'n', 'E', 'p', '3665', 'O', 'l', 'J', 'g', 'Y', '9925', 'n', 'M', '2355', 'Q', '7607', 'I', 'g', '1525', 'x', '941']

3665