[math-fun] coprime problem

Let a, b >= 1, gcd(a, b) = 1. It is not difficult to show that every sufficiently large integer is of the form ax+by where x, y >= 1. Is the same true with the added condition gcd(x, y) = 1?