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]: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']
[A]: 12782


[Q]: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']
[A]: 17360


[Q]: 5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']
[A]:
21977