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, 16, ['1279', '1733', 'd', 'x', '7205', '7697', '4755', '9349', '7249', 'T', '5555', 'S', '887', 'y', '1543', '7063', 'P', 'g', '7057']