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:
7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']

Ex Output:
0


Ex Input:
7, 19, ['6719', 'c', 'S', '3259', '1287', 'u', '9251', '2183', '4821', '9449', 'I', 'P', 'i', '7597', '8141', 'G', 'j', '8587', '7245', 'G', 'O', 'o', '9479']

Ex Output:
57274


Ex Input:
6, 17, ['6333', 'u', 'K', '821', 'R', '6983', '7917', '4693', 'N', 'w', 'k', 'i', 'l', '115', 'T', 'h', '9357']

Ex Output:

29065