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]: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
[EX A]: 0

[EX Q]: 3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
[EX A]: 0

[EX Q]: 11, 13, ['8451', '7131', '103', 'Y', 'I', 'P', 'r', '2799', '9491', 'q', '4063', '9035', '281', 'I', 'm']
[EX A]:
13379