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.

[EX Q]: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']
[EX A]: 12782

[EX Q]: 3, 4, ['F', '7341', 'P', '3315']
[EX A]: 3315

[EX Q]: 3, 13, ['4525', 'L', '4081', 'X', 'J', '3301', 'H', '3897', 'w', '9679', 'A', '2923', '4751']
[EX A]:
28632