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

Ex Output:
12782


Ex Input:
2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']

Ex Output:
13630


Ex Input:
19, 22, ['D', 'B', 'E', 'p', 'f', '2667', 'k', 's', '4435', '1291', 'T', '5941', '3481', '6751', 'v', 'F', 'Y', '8123', 'L', '8791', 'X', '6461', '163', 'T']

Ex Output:

15252