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.

2, 6, ['m', 'q', '4069', '4487', 'c', '4639']
13195

6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
13298

1, 11, ['W', 'w', 'S', '6009', 'p', 'a', '9329', 'F', '7485', '6893', '8597', '6811', 'p', 'O']

38313