#include <fstream>
#include <algorithm>
#include <iostream>

class Bush{
public:
    int x,y;
};

int max(int a,int b);
bool compare(Bush a,Bush b);
bool isOut(int x,int y, int r,int c);
int countPath(Bush bush, int distX,int distY,int r,int c);

bool** bushesField;

void foo(int i);

int main(int argc, const char * argv[]) {
    for(int i=11;i<25;i++){
        foo(i);
    }
    return 0;
}
void foo(int i){
    std::ifstream fin("frog."+std::to_string(i)+".in");
    std::ifstream finA("frog."+std::to_string(i)+".sol");
    Bush* bushes;
    int r,c;
    int n;
    fin>>r;
    fin>>c;
    fin>>n;
    //read
    int x,y;
    bushes=new Bush[n];
    bushesField=new bool*[r+1];
    for(int i=0;i<r+1;i++){
        bushesField[i]=new bool[c+1];
        for(int j=0;j<c+1;j++){
            bushesField[i][j]=0;
        }
    }
    for(int i=0;i<n;i++){
        fin>>x;
        fin>>y;
        bushes[i].x=x;
        bushes[i].y=y;
        bushesField[x][y]=1;
    }
    //sort
    std::sort(bushes, bushes+n, compare);
    //algo
    int distX,distY,nextX,nextY;
    int maxPath=2;
    for(int i=0;i<n-1;i++){
        for(int j=i+1; j<n;j++){
            distX=bushes[j].x-bushes[i].x;
            distY=bushes[j].y-bushes[i].y;
            nextX=bushes[i].x+distX*maxPath;
            nextY=bushes[i].y+distY*maxPath;
            if(nextX > r){
                break;
            }
            if(isOut(bushes[i].x-distX, bushes[i].y-distY,r,c)){
                continue;
            }
            if(!isOut(nextX, nextY,r,c)){
                continue;
            }
            maxPath=max(countPath(bushes[i],distX,distY,r,c),maxPath);
        }
    }
    std::cout<<"My:\n";
    if(maxPath<3){
        std::cout<<0<<"\n";
    } else{
        std::cout<<maxPath<<"\n";
    }
    int a;
    finA>>a;
    std::cout<<"Ans:\n"<<a<<"\n\n";
}

bool compare(Bush a,Bush b){
    if(a.x==b.x){
        return a.y<b.y;
    }
    return a.x<b.x;
}

bool isOut(int x,int y, int r,int c){
    return (0 < x && x < r+1 && 0 < y && y < c+1);
}
int countPath(Bush bush, int distX,int distY,int r,int c){
    int path=0;
    while(isOut(bush.x, bush.y, r, c)){
        if(!bushesField[bush.x][bush.y]){
            return 0;
        }
        bush.x+=distX;
        bush.y+=distY;
        path++;
    }
    return path;
}

int max(int a,int b){
    return a<b ? b : a;
}