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.

[Q]: 4, 22, ['B', 'I', '5423', '9395', '6733', '8815', 'A', 'o', '3809', '7385', 'z', 'Y', 'r', 'b', '903', 'k', '5975', '6687', 'K', '3971', 'r', '9579', 'F', '3705', 'X', 'E', '6071', '8277', '5397']
[A]: 63252


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


[Q]: 9, 11, ['G', 'm', '657', 'n', 'Q', '3745', '5215', 'Z', '5953', 'l', '3843', 'g', 'E', 'b', '3631', '9077', 'D', 'S', 'k', '5339', 'D', '2659', 'U', '457', '8715', 'Q', '193', 'R', '9781']
[A]:
9796