Vasya has a very beautiful country garden that can be represented as an n × m rectangular field divided into n · m squares. One beautiful day Vasya remembered that he needs to pave roads between k important squares that contain buildings. To pave a road, he can cover some squares of his garden with concrete. For each garden square we know number a i j that represents the number of flowers that grow in the square with coordinates ( i , j ) . When a square is covered with concrete, all flowers that grow in the square die. Vasya wants to cover some squares with concrete so that the following conditions were fulfilled: all k important squares should necessarily be covered with concrete from each important square there should be a way to any other important square. The way should go be paved with concrete-covered squares considering that neighboring squares are squares that have a common side the total number of dead plants should be minimum As Vasya has a rather large garden, he asks you to help him. The first input line contains three integers n , m and k ( 1 ≤ n , m ≤ 100 , n · m ≤ 200 , 1 ≤ k ≤ min ( n · m , 7 )) — the garden's sizes and the number of the important squares. Each of the next n lines contains m numbers a i j ( 1 ≤ a i j ≤ 1000 ) — the numbers of flowers in the squares. Next k lines contain coordinates of important squares written as " x y " (without quotes) ( 1 ≤ x ≤ n , 1 ≤ y ≤ m ). The numbers written on one line are separated by spaces. It is guaranteed that all k important squares have different coordinates. In the first line print the single integer — the minimum number of plants that die during the road construction. Then print n lines each containing m characters — the garden's plan. In this plan use character " X " (uppercase Latin letter X) to represent a concrete-covered square and use character "." (dot) for a square that isn't covered with concrete. If there are multiple solutions, print any of them.