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]: 8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']
[A]: 0


[Q]: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']
[A]: 1339


[Q]: 1, 14, ['X', 'c', 'u', '6243', '3181', 'G', '1535', '3295', '9111', 'x', 'V', 'g', '4549', 'B', '1835', '1215', '7315', '4805', '8937', '9709', 'K', '6781', '5917', 'G']
[A]:
27914