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]: 2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']
[EX A]: 20324

[EX Q]: 5, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']
[EX A]: 4383

[EX Q]: 5, 11, ['6445', '8605', 'o', '6671', '959', '1945', '4193', '9499', 'U', '6041', '89', '9959', 'y']
[EX A]:
22726