Kartta

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 1000001

int n, m, h;
int a[101][101];

int main() {
  cin.sync_with_stdio(0);
  cin >> n >> m >> h;
  for(int y = 1; y <= n; ++y) {
    for(int x = 1; x <= m; ++x) {
      cin >> a[y][x];
      cout << 'V';
    }
    cout << "\n";
  }
  for(int z = 2; z <= 40; ++z) {
      for(int y = 1; y <= n; ++y) {
	for(int x = 1; x <= m; ++x) {
	  if(z - 1 == a[y][x]) {
	    cout << 'S'; 
	  } else {
	    cout << 'L';
	  }
	}
	cout << "\n";
      }
  }
  for(int i = 1; i <= h; ++i) {
    cout << i << " ";
    for(int j = 1; j <= i; ++j) {
      cout << j << " ";
    }
    cout << "\n";
  }
  return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER

Test 4

Group: 4

Verdict: OUTPUT LIMIT EXCEEDED