#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <vector>
#include <complex>
#include <ctime>
#include <stack>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define REP(i, n) for(int i = 0; i < (n); ++i)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; --i)
#define FOR(i, x, y) for(int i = (x); i <= (y); ++i)
#define RFOR(i, x, y) for(int i = (x); i >= (y); --i)
#define SZ(a) (ll)(a).size()
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define CLEAR(x) memset(x, 0, sizeof x);
#define COPY(FROM, TO) memcpy(TO, FROM, sizeof TO);
#define UNIQUE(c) SORT(c),(c).resize(unique(ALL(c))-(c).begin())
#define pb push_back
#define mk make_pair
#define sqr(x) ((x)*(x))
#define X first
#define Y second
const long double pi=acos(-1.0);
const double EPS = 1E-9;
const int INF = 2 * (1e+9) + 1;
const int NMAX = 1000000;
const int MOD = (1e+9) + 7;

int a, b, c;
int main () {
  cin >> a >> b;
  c = sqr(a) + sqr(b);
  FOR (i, 1, 1000) {
    FOR (j, 1, 1000) {
      j *= -1;
      int ay = 0, by = 0;
      ay = sqrt (sqr(a) - sqr(i) + .0);
      by = sqrt (sqr(b) - sqr(j) + .0);
      if (sqr(ay) == sqr(a) - sqr(i) && sqr(by) == sqr(b) - sqr(j)) {
        int tmpc = sqr(i - j) + sqr(ay - by);
        if (tmpc == c) {
          cout << "YES\n";
          cout << "0 0\n";
          cout << i << " " << ay << endl << j << " " << by;
          return 0;
        }
      }
      j *= -1;
    }
  }
  cout << "NO\n";
}
/*
3
1 1 1
0 1 1
1 0 0
12
3
2 3
3
2 2
2 2
1 3
3
3
1 2
2 1
1 1
3
*/