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, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

Ex Output:
15701


Ex Input:
3, 22, ['k', '427', 'x', '9695', 'a', '2243', '329', 'F', 'n', '6253', '4873', 'f', 'z', 'R', 'b', '4351', 'b', 'i', 'g', '6937', 'I', 'k', 'f']

Ex Output:
34681


Ex Input:
15, 17, ['7293', 'H', 'V', 'R', 'H', '9993', '2937', 'F', '649', 'P', '9625', '1683', 'p', 'O', 'k', 't', 'f', '4163', '6453', '3055', '5651', '5363', 'X', '3435', '495', 'v', '2483']

Ex Output:

0