Using Euclid’s division algorithm, find the largest number that divides 1251 , 9377 and 15628 leaving remainders 1,2 and 3 respectively.