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]: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']
[A]: 10495


[Q]: 6, 10, ['2095', '7189', 'j', 'i', '6105', 'f', 'I', 'z', '7903', '7165']
[A]: 15068


[Q]: 2, 5, ['8271', '2137', '5441', '1731', 'S', 'm', '8463', 'l', '761', '1385']
[A]:
9309