function pythagoreanMumber(n,m){
let newArray = []
n = n<=1 ? 2 : n
for(let a = n ; a<m-2;a++ ){
for(let b = a+1 ; b<m-1;b++){
for(let c = b+1;c<=m;c++){
if(((a*a) +(b*b) ) === (c*c)){
if(isZhiNumber(a,b) && isZhiNumber(a,c)&& isZhiNumber(b,c)){
newArray.push([a,b,c])
}
}
}
}
}
if(newArray.length<=0){
console.log("Na")
}else{
for(let item of newArray){
console.log(item.toString())
}
}
}
function isZhiNumber(x,y){
let flag = true
for(let i = 2 ; i<=y;i++){
if(x%i == 0 && y%i === 0 && flag === true){
flag = false
}
}
return flag
}
pythagoreanMumber(2,100)