#include "bits/stdc++.h"

using namespace std;

int total_cost(vector <int>& tour, vector <vector <int>> &grid) {
    int total = 0;
    
    for (int i=0; i < tour.size()-1; i++) {
        total += grid[tour[i]][tour[i+1]];

    }
    total += grid[tour[static_cast<int>(tour.size()-1)]][tour[0]];

    return total;
}

vector <int> annealing(double temp, double cool_rate, int steps, vector <vector <int>>& grid) {
    random_device rd;
    mt19937 rng(rd());
    uniform_int_distribution<int> newlocation (0, static_cast<int> (grid.size()) - 1);

    vector <int> tour ((int)grid.size());

    for (int i=0; i < grid.size(); i++) {
        tour[i] = i;
    }

    shuffle(tour.begin(), tour.end(), rng);

    int best_cost = total_cost(tour, grid);
    vector <int> best_tour = tour;

    int differ;
    for (int step=0; step < steps; step++) {

        int i = newlocation(rng), j = newlocation(rng);

        if (i == j)
            continue;
        else
            swap (tour[i], tour[j]);
        
        int current_cost = total_cost(tour, grid);
        differ = current_cost - best_cost;

        if (differ < 0 || exp((static_cast <double>(-differ) / temp)) > static_cast <double>(rng()) / mt19937::max()){
            if (differ < 0){
                best_cost = current_cost;
                best_tour = tour;
            }
        }
        else
            swap (tour[i], tour[j]);
        
        temp *= cool_rate;
    }

    return best_tour;

}

int main() {
    int n, m;
    cin >> n >> m;

    vector <vector <int>> grid (n, vector <int> (m));

    for (int i=0; i < n; i++) {
        for (int j=0; j < m; j++) {
            cin >> grid[i][j];
        }
    }

    double temp;
    double cooling_rate;
    int steps;
    cin >> temp >> cooling_rate >> steps;

    vector <int> tour;

    tour = annealing(temp, cooling_rate, steps, grid);

    int best = total_cost(tour, grid);

    for (int v : tour) {
        cout << v << " --> ";
    }
    cout << tour[0] << "\n";

    cout << best;
    
}