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]: 6, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']
[A]: 0


[Q]: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[A]: 1937


[Q]: 14, 26, ['5465', '7291', 'x', '3727', '4547', 'V', '7261', '1607', 'd', '5379', '7303', '3841', '4983', 'z', '3207', '5389', 'h', '5413', '7893', '1253', 'v', 'I', 'C', 'd', 'G', 'o', 'x', 'R']
[A]:
23155