#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



int index(const vector<int>& v, int x)
{
    return lower_bound(all(v), x) - v.begin();
}
int main()
{
    int n, k;
    cin >> n >> k;

    const int inf = ten(8);

    vector<int> cx, cy, cz;
    int x1[55], y1[55], z1[55], x2[55], y2[55], z2[55];
    rep(i, n)
    {
        cin >> x1[i] >> y1[i] >> z1[i] >> x2[i] >> y2[i] >> z2[i];
        cx.pb(x1[i]), cx.pb(x2[i]);
        cy.pb(y1[i]), cy.pb(y2[i]);
        cz.pb(z1[i]), cz.pb(z2[i]);
    }
    uniq(cx);
    uniq(cy);
    uniq(cz);

    static int imos[111][111][111];
    rep(i, n)
    {
        int cx1 = index(cx, x1[i]);
        int cx2 = index(cx, x2[i]);
        int cy1 = index(cy, y1[i]);
        int cy2 = index(cy, y2[i]);
        int cz1 = index(cz, z1[i]);
        int cz2 = index(cz, z2[i]);

        // xy, z1
        ++imos[cz1][cy1][cx1], --imos[cz1][cy1][cx2];
        --imos[cz1][cy2][cx1], ++imos[cz1][cy2][cx2];

        // xy, z2
        --imos[cz2][cy1][cx1], ++imos[cz2][cy1][cx2];
        ++imos[cz2][cy2][cx1], --imos[cz2][cy2][cx2];
    }

    // imos x
    rep(z, cz.size()) rep(y, cy.size()) rep(x, cx.size())
        imos[z][y][x + 1] += imos[z][y][x];
    // imos y
    rep(z, cz.size()) rep(x, cx.size()) rep(y, cy.size())
        imos[z][y + 1][x] += imos[z][y][x];
    // imos z
    rep(y, cy.size()) rep(x, cx.size()) rep(z, cz.size())
        imos[z + 1][y][x] += imos[z][y][x];

    ll res = 0;
    rep(z, cz.size()) rep(y, cy.size()) rep(x, cx.size())
        if (imos[z][y][x] >= k)
            res += (ll)(cz[z + 1] - cz[z]) * (cy[y + 1] - cy[y]) * (cx[x + 1] - cx[x]);
    cout << res << endl;
}

Measured memory_bytes: 6052