#include<stdio.h>
#include<algorithm>
using namespace std;
int n, m, A[1100][1100],B[3];
int AA[8] = {-2,-2,-1,-1,1,1,2,2};
int BB[8] = {-1,1,-2,2,-2,2,-1,1};
int f(int a, int b){
	if(a<1) return 0;
	if(b<1) return 0;
	if(a>n) return 0;
	if(b>m) return 0;
}
int main(){
	int i, j, k, I, a, b,c,l,t;
	for(I=1;i<=1;i++){
		for(i=0;i<1100;i++)	for(j=0;j<1100;j++)A[i][j]=10000;
		scanf("%d %d %d", &n, &m, &t);
		scanf("%d %d",&a, &b);
		A[a][b]=1;
		scanf("%d %d",&a, &b);
		A[a][b]=2;
		c = 0;
		k = t;
		while(t--){
			for(i=1;i<=n;i++){
				for(j=1;j<=m;j++){
					if(A[i][j]%10>0 and A[i][j]/10==c){
						for(l=0;l<8;l++){
							if(f(i+AA[l],j+BB[l])){
								A[i+AA[l]][j+BB[l]]=min(A[i+AA[l]][j+BB[l]],A[i][j]+10);
							}
						}
					}
				}
			}
			c++;
		}
		for(i=1;i<=n;i++) for(j=1;j<=m;j++) B[A[i][j]%10]++;
		printf("%d\n%d\n",(B[1]-1)/k,(B[2]-1)/k);
	}
	
}