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:
6, 10, ['2095', '7189', 'j', 'i', '6105', 'f', 'I', 'z', '7903', '7165']

Ex Output:
15068


Ex Input:
13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']

Ex Output:
14716


Ex Input:
2, 3, ['x', 'W', '1317', 'Z', '2365', '4823', 'H', 'e', 'D', '7317', 'P', 'B', 'z', '3213', 'Y', 'u', 'g', '6823', '6069', '4807', '9659', 'd', 'k', '8337', 'a', 'n']

Ex Output:

1317