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.
11, 13, ['n', 'e', 'w', 'h', '6849', '8661', '6691', '2475', 'c', 'k', '9987', 'g', '4897', 'c', 'e', '6789', '5675', 'C']