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]: 7, 12, ['273', 'h', '2433', '7155', '731', '5459', 'q', 'G', 'i', 'l', '3981', 'W', 'V', '4999', '8191', 'K', '8393', '9255']
[A]: 3981


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


[Q]: 12, 20, ['535', 't', 'c', '3777', 'B', 'x', 'n', 'G', '4739', '5207', '5227', 'B', 't', '8005', 'i', '1245', '2835', '1155', 'f', 'W', '8977', '6753', 'P']
[A]:
13240