#include <iostream>
#include <fstream>
using namespace std;
ifstream f("reuniune.in");
ofstream g("reuniune.out");
struct drept
{
    int x0;
    int x1;
    int y0;
    int y1;
} v[4];
long long int A, P;
inline long long int arie(drept d)
{
    long long a = 1LL * (d.x1 - d.x0) * (d.y1 - d.y0);
    return a;
}
inline long long int perimetru(drept d)
{
    long long p = 2LL * (d.x1 + d.y1 - d.x0 - d.y0);
    return p;
}
drept intersectie(drept d1, drept d2)
{
    drept d;
    d.x0 = max(d1.x0, d2.x0), d.x1 = min(d1.x1, d2.x1);
    d.y0 = max(d1.y0, d2.y0), d.y1 = min(d1.y1, d2.y1);
    if(d.x0 > d.x1 || d.y0 > d.y1)
    {
        d.x0 = d.x1 = 0; ///intersectie vida
        d.y0 = d.y1 = 0;
    }
    return d;
}
int main()
{
    f >> v[1].x0 >> v[1].y0 >> v[1].x1 >> v[1].y1;
    f >> v[2].x0 >> v[2].y0 >> v[2].x1 >> v[2].y1;
    f >> v[3].x0 >> v[3].y0 >> v[3].x1 >> v[3].y1;
    A = arie(v[1]) + arie(v[2]) + arie(v[3]);
    P = perimetru(v[1]) + perimetru(v[2]) + perimetru(v[3]);
    A -= arie(intersectie(v[1], v[2]))  + arie(intersectie(v[1], v[3])) + arie(intersectie(v[2], v[3]));
    A += arie(intersectie(intersectie(v[1], v[2]), v[3]));
    P -= perimetru(intersectie(v[1], v[2])) + perimetru(intersectie(v[1], v[3])) + perimetru(intersectie(v[2], v[3]));
    P += perimetru(intersectie(intersectie(v[1], v[2]), v[3]));
    g << A << ' ' << P;
    return 0;
}