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, 15, ['U', 'G', '4461', '7163', '5651', 'x', '4017', 'W', '7237', 'k', 'b', 'k', 'h', '9147', 'T', '9035', '537', 'Y', 'Q']

Ex Output:
20401


Ex Input:
17, 18, ['449', '4995', 'M', '245', 'i', '6859', 'A', '3527', '7063', 'l', '2869', 'Z', '8739', '7057', '4815', '3263', 'P', 'l', '393', 'P', '1701', '5135', 'G', 'O', 'y', 'o', '3815']

Ex Output:
0


Ex Input:
3, 6, ['7285', '8509', 'G', '2017', 'c', 'x', 'V', '8177', 'y', '5893', 'a', 'f', 'J', 'd']

Ex Output:

2017