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.
14, 23, ['521', 'j', '1699', '2131', 'n', 'X', '6117', 'H', 'p', 'E', '5845', '1337', '8267', '8119', 'Z', 'o', 'i', '6437', '7309', 'n', 'w', '9259', 'd', '7563', 'i']