N6_отбор

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector <bool> pr(1e4, 1);
    for (int i = 2; i < 1e4; ++i) {
        if (!pr[i]) {
            continue;
        }
        for (int j = 2 * i; j < 1e4; j += i) {
            pr[j] = 0;
        }
    }
    for (ll p = 1; p <= 1e3; ++p) {
        for (ll q = 1; q <= 1e3; ++q) {
            for (ll n = 1; n <= 1e3; ++n) {
                if (q * q % 961 != 0) {
                    continue;
                }
                if (!pr[p] || !pr[q]) {
                    continue;
                }
                ll s = pow(p, 4) + 9 * q * q / 961;
                if (s == n * n) {
                    cout << "OK\n";
                    cout << p << ' ' << q << ' ' << n << "\n";
                    cout << p * q * n << "\n";
                }
            }
        }
    }
}