#!/usr/bin/env python
import re, math
def print_keyval(dic, re_key=r'^[^_]'):
 print('\t'.join(['%s=%s' % (key, dic[key]) for key in dic
                  if not isinstance(dic[key], __builtins__.__class__) and
                     not callable(dic[key]) and re.search(re_key, key)]))
for  m in range(1, 60 + 1): ## 60 avoids 5-digit x or y
 for n in range(1, m):
  if m & 1 == 1 and n & 1 == 1: continue ## at least one even
  if math.gcd(m, n) > 1       : continue ## coprime
  a = 2 * m * n
  b = m * m - n * n
  c = m * m + n * n
  for (x, y) in [(c + a, b), (c + b, a)]:
   rxy = (x * y) ** 0.5
   if abs(rxy - int(rxy)) < 1e-5: print_keyval(locals())