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:
4, 4, ['2107', 'l', '7551', '4907']

Ex Output:
4907


Ex Input:
2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']

Ex Output:
47279


Ex Input:
12, 22, ['b', 'L', '7783', 'c', '2443', 'x', '3969', '9015', '8715', '8257', '6249', 'R', '109', 'F', 'E', 'I', '3775', 'Q', '1719', 'o', 'x', '9145', 'n', 'i', '5013', '341', '6409', '813']

Ex Output:

14748