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]: 9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']
[A]: 0


[Q]: 4, 5, ['b', 'u', '5279', '6945', '6631']
[A]: 13576


[Q]: 8, 11, ['G', '2899', 'g', 'I', 'e', '2149', '4651', 'w', '9399', 'u', 'D', 'j', 'C', 'E', '6317', '3619', 't', '5907', 'h']
[A]:
9399