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, 9, ['7895', '3853', 's', '7', '1351', '5409', 'y', 'R', '329', 'l', 'v', '569', '8461', 'O', 'p', '2845']
5738

4, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']
9745

2, 9, ['J', '1549', 'm', 'y', '3779', '4833', '5791', '8759', '6061']

30772