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]: 3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']
[A]: 0


[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]: 9, 10, ['8711', '6413', '979', 'O', 'Z', 'Q', 'V', '3343', '5611', '9463', 'X', 'N', 'b', 'm', '255', '111', '7501', 'N', 'V', 'N', 'A']
[A]:
15074