#include <iostream>
#include <vector>

using namespace std;

class matr {
    int** a;
    int n, m;
public:
    matr(int in, int im) {
        n = in;
        m = im;
        a = new int*[n];
        for (int i = 0; i < n; i++)
            a[i] = new int[m];
    }

    int get_element(int i, int j) {
        return a[i][j];
    }

    int get_n() {
        return n;
    }

    int get_m() {
        return m;
    }

    read() {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++)
                cin >> a[i][j];
        }
    }

    ~matr() {
        for (int i = 0; i < n; i++)
            delete a[i];
        delete [] a;
    }
};

class graph {
    vector < vector<int> > a;
    int n, k;
public:
    graph(matr* matr_s, matr* matr_i) {
        n = matr_s.n;
        k = matr_i.n;
        int v = 0, u = 0, t;
        for (int i = 0; i < k; i++)(
            for (int j = 0; j < n; j++) {
            t = 0;
            v = 0;
            u = 0;
            if (matr_i->get_element(i, j) == 1) {
                    v = j;
                    t++;
                }
                if (matr_i->get_element(i, j) == -1) {
                    u = j;
                    t++;
                }
                if (t == 2)
                    break;
            }

    }
}

find_path(int start, int finish) {

}

~graph() {
    for (int i = 0; i < n; i++) {
        delete a[i];
    }
    delete a[];
}
};

int main() {
    cin>>n>>m;
    cout<<3;
    matr_smezh smezh(n, m);
    return 0;
}