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.
6, 7, ['M', '1887', 'q', 'W', 't', '6755', '9779', 'O', '2111', '2451', 'G', 's', '1603', '8263', '8579', '9579', 'c', 'k', 'd', 'A', 'S', 's', 'r', '8857']