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]: 3, 22, ['k', '427', 'x', '9695', 'a', '2243', '329', 'F', 'n', '6253', '4873', 'f', 'z', 'R', 'b', '4351', 'b', 'i', 'g', '6937', 'I', 'k', 'f']
[A]: 34681


[Q]: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
[A]: 24200


[Q]: 6, 9, ['5917', 'N', 'u', 'f', '2985', '1159', 'A', 'M', 'I']
[A]:
1159