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:
1, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']

Ex Output:
0


Ex Input:
12, 15, ['I', 'H', '3483', '6289', 'X', '5705', '7707', 'x', 'J', 'c', '5161', '9653', '3949', 'l', 'b', 'C', 's', '17', 'a', '4231', 't']

Ex Output:
13602


Ex Input:
5, 11, ['y', 'M', 'C', 'q', '4071', 'A', 'm', '8885', 'n', '7725', 'k', 'I', 'G', '615', 'r', 'z', 'i', '3641', '4011', '4047', 'V', '497', 'u', 'B', 'j']

Ex Output:

20681