Determine all possible triplets of positive integers (p, q, r) satisfying p = q² + r² with q ≤ r such that gcd (q, r) = 1 and qr/s is a positive integer for every prime s ≤ √p

Note: gcd denotes the greatest common divisor.