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 Q]: 3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
[EX A]: 8337

[EX Q]: 2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
[EX A]: 26162

[EX Q]: 12, 15, ['7933', '6321', '6815', 'r', 'y', '2015', 'I', 'e', '7733', '1969', '1973', '3141', '6607', 'n', '5417', '5927', '8123', 'j', 'G', 'f', 'F', '3305', 'M', 'E', 'v', 'c']
[EX A]:
15165