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]: 4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']
[A]: 15701


[Q]: 14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']
[A]: 5085


[Q]: 7, 28, ['G', 'i', 'H', '707', '8925', 'T', '6907', '2391', '5427', '8109', 'u', 'P', 'R', '4765', '2535', '6617', 'l', 'd', '6665', '3829', 'a', 'G', 'v', '9103', '955', '8527', '3389', 'S']
[A]:
69219