#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <set>
#include <queue>

class Graph {
 private:
    int size_g;
    std::vector<std::vector<int>> data;
    std::vector<int> fleas;
    std::vector<int> used;
    std::vector<std::vector<int>> coordinates;
    int size_H;
    int size_W;

 public:
    std::vector<bool> isused;
    std::vector<int> distance;

    explicit Graph(int n) {
        data.resize(n);
        isused.resize(n);
        size_g = n;
    }

    Graph(int h, int w) {
        size_g = h * w;
        size_H = h;
        size_W = w;
        isused.resize(h * w);
        coordinates.resize(h * w);
        int counter = 0;
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < w; j++) {
                coordinates[counter].push_back(i);
                coordinates[counter].push_back(j);
                counter++;
            }
        }
    }

    void insert(int a, int b) {
        if (a != b) {
            data[a - 1].push_back(b);
            data[b - 1].push_back(a);
        }
    }

    explicit Graph(std::vector<std::vector<int>> graph) {
        isused.resize(graph.size());
        size_g = graph.size();
        data = graph;
    }

    void printgraph() {
        for (int i = 0; i < data.size(); i++) {
            for (auto j : data[i]) {
                std::cout << j << " ";
            }
            std::cout << '\n';
        }
    }

    std::vector<int> neighbours(int a) {
        int y = coordinates[a][0];
        int x = coordinates[a][1];
        std::vector<int> result;
        int n1 = a + 2 * size_W + 1;
        int n2 = a + 2 * size_W - 1;
        int n3 = a - 2 * size_W + 1;
        int n4 = a - 2 * size_W - 1;
        int n5 = a + size_W + 2;
        int n6 = a + size_W - 2;
        int n7 = a - size_W + 2;
        int n8 = a - size_W - 2;
        bool check1 = y + 2 < size_H && x + 1 < size_W;
        bool check2 = y + 2 < size_H && x - 1 > -1;
        bool check3 = y - 2 > -1 && x + 1 < size_W;
        bool check4 = y - 2 > -1 && x - 1 > -1;
        bool check5 = y + 1 < size_H && x + 2 < size_W;
        bool check6 = y + 1 < size_H && x - 2 > -1;
        bool check7 = y - 1 > -1 && x + 2 < size_W;
        bool check8 = y - 1 > -1 && x - 2 > -1;
        if (check1 && !isused[n1]) {
            result.push_back(n1);
        }
        if (check2 && !isused[n2]) {
            result.push_back(n2);
        }
        if (check3 && !isused[n3]) {
            result.push_back(n3);
        }
        if (check4 && !isused[n4]) {
            result.push_back(n4);
        }
        if (check5 && !isused[n5]) {
            result.push_back(n5);
        }
        if (check6 && !isused[n6]) {
            result.push_back(n6);
        }
        if (check7 && !isused[n7]) {
            result.push_back(n7);
        }
        if (check8 && !isused[n8]) {
            result.push_back(n8);
        }
        return result;
    }

    int bfschess(int start, std::vector<int> fleas) {
        std::queue<int> vert;
        std::vector<int> result(size_g, -1);
        vert.push(start);
        isused[start] = true;
        result[start] = 0;
        while (vert.size() != 0) {
            int s = vert.front();
            vert.pop();
            std::vector<int> child = neighbours(s);
            for (auto into : child) {
                if (!isused[into]) {
                    isused[into] = true;
                    vert.push(into);
                    result[into] = result[s] + 1;
                }
            }
        }
        int answer = 0;
        for (auto i : fleas) {
            if (result[i] == -1) {
                answer = -1;
                break;
            } else {
                answer += result[i];
            }
        }
        return answer;
    }

    void Dijkstra(int a, int b) {
        isused.clear();
        isused.resize(size_g);
        isused[a - 1] = true;
        std::vector<int> result;
        std::vector<int> way;
        std::vector<std::vector<int>> ways;
        ways.resize(size_g);
        result = data[a - 1];
        int v;
        for (int i = 0; i < size_g; i++) {
            if (result[i] != 200000) {
                ways[i].push_back(i + 1);
            }
        }
        for (int j = 0; j < size_g; j++) {
            v = -1;
            for (int i = 0; i < size_g; i++) {
                if (!isused[i] && ((v == -1) || result[v] > result[i])) {
                    v = i;
                }
            }
            if (v == -1) {
                v = size_g - 1;
            }
            isused[v] = true;
            for (int i = 0; i < size_g; i++) {
                if (result[i] > result[v] + data[i][v]) {
                    ways[i].clear();
                    ways[i].insert(ways[i].end(), ways[v].begin(), ways[v].end());
                    ways[i].push_back(i + 1);
                    result[i] = result[v] + data[v][i];
                }
            }
        }
        if (result[b - 1] <= 0 || result[b - 1] == 200000) {
            std::cout << -1;
        } else {
           std::cout << result[b - 1] << "\n";
           std::cout << a;
           for (auto i : ways[b - 1]) {
              std::cout << " " << i;
           }
           std::cout << '\n';
        }
    }
};

int main() {
    int N, M, S, T, Q;
    int a, b;
    std::cin >> N >> M >> S >> T >> Q;
    std::vector<int> fleas;
    for (int i = 0; i < Q; i++) {
        std::cin >> a >> b;
        fleas.push_back((a - 1) * M + b - 1);
    }
    Graph graph(N, M);
    std::cout << graph.bfschess((S - 1) * M + (T - 1), fleas);
}