#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1LL << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }
 
template <class T> void uniq(vector<T>& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
  
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }
  
template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print(const T& c, const string& deli = " ", int br = 1) { foreach (it, c) { cout << *it; if (++it != c.end()) cout << deli;--it; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
   
template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
 

typedef long long ll;
typedef pair<int, int> pint;
 
// y(v): v>^<  y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);

#define F first
#define S second



struct Rect
{
    int v[3][2];
    ll calc_area() const
    {
        ll res = 1;
        rep(d, 3)
            res *= v[d][1] - v[d][0];
        return res;
    }
};
typedef pair<Rect, int> Area; // (rect, num of fishes)

bool intersect(const Rect& a, const Rect& b, Rect& r)
{
    rep(d, 3)
    {
        r.v[d][0] = max(a.v[d][0], b.v[d][0]);
        r.v[d][1] = min(a.v[d][1], b.v[d][1]);
        if (r.v[d][0] >= r.v[d][1])
            return false;
    }
    return true;
}

int main()
{
    int n, k;
    cin >> n >> k;

    const int inf = ten(8);
    Rect inf_rect;
    rep(d, 3)
    {
        inf_rect.v[d][0] = -inf;
        inf_rect.v[d][1] = inf;
    }

    vector<Area> area;
    area.pb(make_pair(inf_rect, 0));
    rep(fi, n)
    {
        Rect fish;
        rep(i, 2) rep(d, 3)
            cin >> fish.v[d][i];

        vector<Area> narea;
        foreach (it, area)
        {
            Rect and_rect;
            if (intersect(fish, it->first, and_rect))
            {
                narea.pb(make_pair(and_rect, it->second + 1));

                int bound[3][4];
                rep(d, 3)
                {
                    bound[d][0] = -inf;
                    bound[d][1] = and_rect.v[d][0];
                    bound[d][2] = and_rect.v[d][1];
                    bound[d][3] = inf;
                }

                rep(i, 3) rep(j, 3) rep(k, 3)
                {
                    if (i == 1 && j == 1 && k == 1)
                    {
                        // excluding: temp_rect == and_rect
                        continue;
                    }

                    Rect temp_rect;
                    temp_rect.v[0][0] = bound[0][i];
                    temp_rect.v[0][1] = bound[0][i + 1];

                    temp_rect.v[1][0] = bound[1][j];
                    temp_rect.v[1][1] = bound[1][j + 1];

                    temp_rect.v[2][0] = bound[2][k];
                    temp_rect.v[2][1] = bound[2][k + 1];

                    Rect and_r;
                    if (intersect(temp_rect, it->first, and_r))
                        narea.pb(make_pair(and_r, it->second));
                }
            }
            else
                narea.pb(*it);
        }

        area = narea;
    }

    ll res = 0;
    foreach (it, area)
        if (it->second >= k)
            res += it->first.calc_area();
    cout << res << endl;
}

Measured memory_bytes: 11348