#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>
#include <bitset>
#include<complex>
 
using namespace std;
 
/* template */
 
using ll = long long;
 
void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif
 
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
struct Edge{
    int to;
    ll weight;
    Edge(int t, ll w) : to(t), weight(w){ }
};
 
struct edge{
    int from;
    int to;
    ll weight;
    edge(int f,int t,ll w) : from(f), to(t), weight(w){ }
};
 
 
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;
 
template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}
 
template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}
 
template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}
 
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
 
constexpr ll LNF = 1LL<<50;
 
constexpr int INF = 1e9+7;
 
const long double PI=3.14159265358979323846;
 
 
vector<int> dx = {1,0,-1,1,-1,0};
vector<int> dy = {1,1,1,0,0,-1};
 
/* template */

template<class T>
struct mycomplex{
    T real;
    T imag;

    mycomplex(T x=0, T y=0) : real(x), imag(y) {}

    mycomplex<T> conj(){
        return mycomplex<T>{real, -imag};
    }

    T abs(){
        return sqrt(real*real + imag*imag);
    }

    T norm(){
        return (real*real + imag*imag);
    }

    mycomplex operator-() const {return mycomplex<T>(-real,-imag);}
    mycomplex& operator+=(const mycomplex<T> a){
        real += a.real; imag += a.imag;
        return *this;
    }
    mycomplex& operator-=(const mycomplex<T> a){
        real -= a.real; imag -= a.imag;
        return *this;
    }
    mycomplex& operator*=(const mycomplex<T> a){
        T x = a.real * real - a.imag * imag;
        T y = a.imag * real + a.real * imag;
        real = x; imag = y;
        return *this;
    }
    mycomplex& operator*=(const T a){
        real *= a;
        imag *= a;
        return *this;
    }

    mycomplex operator+(const mycomplex<T> a) const { return mycomplex<T>(*this) += a; }
    mycomplex operator-(const mycomplex<T> a) const { return mycomplex<T>(*this) -= a; }
    mycomplex operator*(const mycomplex<T> a) const { return mycomplex<T>(*this) *= a; }
    mycomplex operator*(const T a) const { return mycomplex<T>(*this) *= a; }

};

using P = mycomplex<double>; //点
using L = pair<P,P>; //直線
const double EPS = 1e-9;
#define X real()
#define Y imag()

bool equal(P n, P m){
    return (n-m).abs() < EPS;
}

double dot(P a, P b){
    return (a.conj()*b).real;
}

double cross(P a, P b){
    return (a.conj()*b).imag;
}

P proj(P a1, P a2, P p){ //点pから直線a1-a2への射影点
    return a1 +  (a2-a1)*(dot(a2-a1,p-a1)/(a2-a1).norm());
}

P refl(P a1, P a2, P p){ //点pの直線a1-a2に対して点対称な点
    return proj(a1,a2,p)*(double)2 - p;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    double x1,y1,x2,y2;
    cin >> x1 >> y1 >> x2 >> y2;
    P p1,p2,p;
    p1 = {x1,y1}; p2 = {x2,y2};
    int q; cin >> q;
    while(q){
        double a,b; cin >> a >> b;
        p = {a,b};
        auto x = proj(p1,p2,p);
        cout << fixed << setprecision(15) << x.real << " " << x.imag << '\n';
        q--;
    }
}


Measured memory_bytes: 3316