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.

[EX 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']
[EX A]: 34681

[EX Q]: 1, 2, ['j', '3613']
[EX A]: 3613

[EX Q]: 8, 12, ['w', 'i', 'J', '3629', 'Z', 'g', '4461', 'e', 'V', '8771', 'q', 'H', 'U', 'e', '2681', '4771', '8553', '7535']
[EX A]:
8771