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.

[Q]: 1, 10, ['N', 'p', 'z', '6083', 'x', 'x', '3063', 'Y', '7099', '9961', 'k', '7365', 'e', '8629', '9595', '2831', '3649', '3809', 'm']
[A]: 26206


[Q]: 6, 7, ['6947', 'l', 'd', '6531', 'X', 'l', '9741', '6553', '9905', 'n', 'Q', 'Y', '2063']
[A]: 9741


[Q]: 2, 11, ['4665', 'N', 'y', '8617', '2627', 'I', 'a', 'o', '135', '5483', '3039', '4751', 'F', '6061', '9841', 'Z', '5915', '6781', '9121', 'e', 'Y']
[A]:
19901