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, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']
[EX A]: 13630

[EX Q]: 3, 10, ['r', 'A', 'l', '7169', '3249', 'T', 'O', 'g', 'F', 'M', 'R', '171', 'M', '2449', '3749', 'f']
[EX A]: 10418

[EX Q]: 3, 6, ['3189', 'g', '1027', 'j', 'e', '4235', '1731', '5621', 'O', '9313', 'D', '6739', 'J', 'L', '2775', 'u', 'r']
[EX A]:
5262