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]: 22, 25, ['681', '2393', 'f', 'g', '5051', '5839', 'T', 'p', '8057', '6929', 'N', '1519', 'G', '8969', '8589', 'T', 't', '4915', 'r', 'M', 'N', '8285', '8607', '4333', '7457', '343', 'f', 'r']
[A]: 28682


[Q]: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']
[A]: 28268


[Q]: 4, 6, ['9049', 'y', '5207', 'm', 'l', '7505', '5945', '7511']
[A]:
7505