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, 4, ['581', 'a', 'k', '8685', '1931', 'm', 'o', 'q', 'X', '8399', 'F', '4247', '1429', 'j', '7413', '4133', '551', 'n', 'z', '6119', '653', 'n', 'n', '2845', 'X', '1407', '8225', '7145', 's']