#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>
   
using namespace std;
   
 
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#else
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
 
#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))
   
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

template <class T> void sort(vector<T>& c) { sort(c.begin(), c.end()); }
template <class T> void unique(vector<T>& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
typedef long long ll;
typedef pair<int, int> pint;
   
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os;  }
  
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; }
  
bool valid(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
   
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]; }
  
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
  
const double PI = acos(-1.0);
const int mod = 1000000007;



int main()
{
    int n, r;
    while (scanf("%d%d", &n, &r), n)
    {
        vector<int> in[10010], out[10010];
        int x1[10010], y1[10010], x2[10010], y2[10010];
        int min_x = 1e9, max_x = 0, min_y = 1e9, max_y = 0;
        for (int i = 0; i < n; ++i)
        {
            scanf("%d%d%d%d", x1 + i, y1 + i, x2 + i, y2 + i);
            min_swap(min_x, ++x1[i]);
            min_swap(min_y, ++y1[i]);
            max_swap(max_x, ++x2[i]);
            max_swap(max_y, ++y2[i]);

            in[y1[i]].push_back(i);
            out[y2[i]].push_back(i);
        }

        int a[2][10100] = {};

        set<int> u;
        int area = 0, len = 0;
        for (int y = min_y; y <= max_y; ++y)
        {
            int* cur = a[y & 1];
            int* prev = a[!(y & 1)];

            for (int i = 0; i < out[y].size(); ++i)
                u.erase(out[y][i]);
            for (int i = 0; i < in[y].size(); ++i)
                u.insert(in[y][i]);

            fill(cur + (min_x - 1), cur + (max_x + 1), 0);
            foreach (it, u)
            {
                int i = *it;
                max_swap(cur[x1[i]], x2[i] - x1[i]);
            }

            for (int x = min_x; x <= max_x; ++x)
            {
                if (cur[x] == 0)
                {
                    if (cur[x - 1] > 0)
                        ++len;
                    if (prev[x] > 0)
                        ++len;
                }
                else
                {
                    if (cur[x - 1] == 0)
                        ++len;
                    if (prev[x] == 0)
                        ++len;
                    ++area;

                    max_swap(cur[x + 1], cur[x] - 1);
                }
            }
        }

        if (r == 1)
            printf("%d\n", area);
        else
            printf("%d\n%d\n", area, len);
    }
}

Measured memory_bytes: 2412