uva10010 - Where's Waldorf?

#include <stdio.h>
#include <string.h>

char map[100][100];

void initilalize ( const int n, const int m )
{
for ( int i = 1; i <= n; i++ )
for ( int j = 1; j <= m; j++ )
if ( 'A' <= map[i][j] && map[i][j] <= 'Z' )
map[i][j] += 'a' - 'A';
}

void find ( char str[], const int n, const int m )
{
int len = strlen ( str ), i;
for ( i = 0; i < len; i++ )
if ( 'A' <= str[i] && str[i] <= 'Z' )
str[i] += 'a' - 'A';
for ( i = 1; i <= n; i++ )
for ( int j = 1; j <= m; j++ )
{
if ( map[i][j] != str[0] )
continue;
int x = i, y = j, flag[8] = {0}, k = 1;
while ( map[x+1][y+1] == str[k] && k < len )
{
flag[0]++;
k++;
x++;
y++;
}
x = i;
y = j;
k = 1;
while ( map[x][y+1] == str[k] && k < len )
{
flag[1]++;
k++;
y++;
}
x = i;
y = j;
k = 1;
while ( map[x-1][y+1] == str[k] && k < len )
{
flag[2]++;
x--;
k++;
y++;
}
x = i;
y = j;
k = 1;
while ( map[x-1][y] == str[k] && k < len )
{
flag[3]++;
k++;
x--;
}
x = i;
y = j;
k = 1;
while ( map[x-1][y-1] == str[k] && k < len )
{
flag[4]++;
k++;
x--;
y--;
}
x = i;
y = j;
k = 1;
while ( map[x][y-1] == str[k] && k < len )
{
flag[5]++;
k++;
y--;
}
x = i;
y = j;
k = 1;
while ( map[x+1][y-1] == str[k] && k < len )
{
flag[1]++;
k++;
y--;
x++;
}
x = i;
y = j;
k = 1;
while ( map[x+1][y] == str[k] && k < len )
{
flag[1]++;
k++;
x++;
}
for ( k = 0; k < 8; k++ )
if ( flag[k] == len - 1 )
{
printf ( "%d %d\n", i, j );
return ;
}
}
}

int main ( )
{
int t;
scanf ( "%d", &t );
while ( t-- )
{
int n, m;
scanf ( "%d%d", &n, &m );
memset ( map, '*', sizeof map );
for ( int i = 1; i <= n; i++ )
scanf ( "%s", map[i]+1 );
initilalize ( n, m );
int cont;
scanf ( "%d", &cont );
while ( cont -- )
{
char str[100];
scanf ( "%s", str );
find ( str, n, m );
}
if ( t )
puts ( "" );
}
return 0;
}