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, ['6675', 'b', '2145', '4165', '695', '3789', 'g', '8821', 'H', '4241', 'R', '401', '2623', 'S', '5785', 'o', '5251', 'a', 'K', '8457', 'n', 'd', 'O', 'r', 'd', 'd', 'F', '1925']