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, 8, ['147', 'w', 'Z', 'T', '4591', 'p', 'M', 'O', 'K']
[EX A]: 4591

[EX Q]: 9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']
[EX A]: 2445

[EX Q]: 4, 11, ['Z', 'a', 'Z', 'e', 'D', '6699', 'y', '6005', '5191', '6303', 'M', 'Y', '8069', 'Q', 'M', '2499', 'V', 'Z', 'u', 'z', 'C', 'S', 'l', '8579', '4573']
[EX A]:
24198