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]: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']
[A]: 11880


[Q]: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']
[A]: 0


[Q]: 2, 12, ['4895', '8675', '4825', 'G', '487', '8345', '7423', '799', '9267', 'I', '7331', 'j', '7065', '4879', '1117', '1823', '5753', '2259', '5925', 'N', 'B', '8983', '357']
[A]:
47152