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]: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
[EX A]: 10058

[EX Q]: 1, 2, ['t', '9343', 'g']
[EX A]: 9343

[EX Q]: 8, 15, ['n', 'V', 'n', '7309', '3987', '1065', '8555', 'X', 'E', 'a', '4173', 'n', 'q', '1701', '4993', '3113', 'I', 'h', '73', 'v', '4383']
[EX A]:
10867