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]: 3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
[A]: 0


[Q]: 2, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']
[A]: 53691


[Q]: 9, 11, ['2611', '2603', '5365', '7429', 'n', 's', '9505', 's', '9343', '7117', 'a', '4869', '3317', '2595']
[A]:
16460