<?php

function findStartingPoint($matrix) {
    foreach ($matrix as $i => $row) {
        $col = strpos($row, 'M');
        if ($col !== false) {
            return [$i, $col];
        }
    }
    return [-1, -1];
}

function isWithinBounds($x, $y, $n, $m) {
    return $x >= 0 && $x < $n && $y >= 0 && $y < $m;
}

function countLuck($matrix, $k) {
    list($n, $m) = [count($matrix), strlen($matrix[0])];
    list($startX, $startY) = findStartingPoint($matrix);
    $dx = [-1, 1, 0, 0];
    $dy = [0, 0, -1, 1];
    $queue = [[$startX, $startY, 0]];
    $visited = array_fill(0, $n, array_fill(0, $m, false));
    $visited[$startX][$startY] = true;

    while (!empty($queue)) {
        list($x, $y, $waveCount) = array_shift($queue);

        if ($matrix[$x][$y] === '*') {
            return $waveCount === $k ? "Impressed" : "Oops!";
        }

        $possibleMoves = 0;
        foreach (range(0, 3) as $i) {
            $nx = $x + $dx[$i];
            $ny = $y + $dy[$i];
            if (isWithinBounds($nx, $ny, $n, $m) && !$visited[$nx][$ny] && $matrix[$nx][$ny] !== 'X') {
                $possibleMoves++;
            }
        }

        foreach (range(0, 3) as $i) {
            $nx = $x + $dx[$i];
            $ny = $y + $dy[$i];
            if (isWithinBounds($nx, $ny, $n, $m) && !$visited[$nx][$ny] && $matrix[$nx][$ny] !== 'X') {
                $visited[$nx][$ny] = true;
                $queue[] = [$nx, $ny, $waveCount + ($possibleMoves > 1 ? 1 : 0)];
            }
        }
    }

    return "Oops!";
}

// Input reading
$handle = fopen("php://stdin", "r");
$testCases = intval(fgets($handle));
for ($t = 0; $t < $testCases; $t++) {
    list($n, $m) = array_map('intval', explode(' ', fgets($handle)));
    $matrix = [];
    for ($i = 0; $i < $n; $i++) {
        $matrix[] = trim(fgets($handle));
    }
    $k = intval(fgets($handle));
    echo countLuck($matrix, $k) . "\n";
}
fclose($handle);

?>