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]: 11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']
[EX A]: 7973

[EX Q]: 2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
[EX A]: 26162

[EX Q]: 6, 18, ['I', 'K', 'S', 'x', '8407', 'r', 'Y', '5219', 'v', '6671', 's', 'G', 'R', '9803', '3197', '1889', 'a', '2753', '3321']
[EX A]:
29532