7 2
-10 0 ? 1 ? 2 10
 1 1
0
 5 1
-3 -2 -1 0 1
 7 1
-4 ? ? ? ? ? 2
 17 1
? -13 ? ? ? -3 ? ? ? ? ? 10 ? ? ? ? 100
 3 1
-5 ? 0
 7 2
-10 0 ? 1 6 2 ?
 3 1
-3 ? -2
 6 1
-1 ? 1 2 3 4
 1 1
?
 9 2
-10 0 ? 1 ? 2 ? 3 ?
 10 2
3 ? 5 ? 7 ? 9 ? 11 ?
 9 2
? ? -10 ? ? ? 10 ? ?
 9 3
? ? ? ? ? ? ? ? ?
 7 2
? ? 10 ? ? ? ?
 5 1
1000000000 ? ? ? ?
 7 3
1 ? -1000000000 ? 100 ? 2
 7 2
? ? -10 ? ? ? ?
 39 3
-5 1 -13 ? 2 -12 ? 3 -11 -2 4 -10 ? 5 -9 0 6 -8 ? 7 -7 ? 8 -6 5 9 -5 ? 10 -4 ? 11 -3 ? 12 -2 10 13 -1
 7 2
? ? 10 ? -10 ? ?
 7 1
-2 ? ? ? ? ? 4
 7 2
-10 0 0 1 ? 2 ?
 9 2
-10 0 ? 1 -6 2 ? 3 ?
 7 3
1 ? -1000000000 ? 100 ? 3
 9 2
-10 0 ? 1 ? 2 ? 3 0
 9 2
10 0 ? 1 ? 2 ? 3 ?
 3 1
-1 ? 1
 10 1
-2 ? ? ? ? ? ? 5 ? 10
 5 2
? ? -1000000000 ? ?
 2 1
-1000000000 1000000000
 7 2
-10 0 ? 1 -6 2 ?
 5 4
-1 ? ? ? 2
 7 2
10 0 ? 1 ? 2 ?
 7 2
-10 0 ? 1 ? 2 0
 7 2
-10 0 ? 1 ? 2 ?
 7 2
? ? -10 ? 10 ? ?
 6 1
-3 ? ? ? ? 3
 9 2
-10 0 ? 1 ? 2 ? 3 10
 3 1
4 ? 5
 9 3
-5 0 -1 ? ? ? 0 5 1
 7 1
-3 ? ? ? ? ? 3

-10 0 -1 1 0 2 10
 0
 -3 -2 -1 0 1
 -4 -3 -2 -1 0 1 2
 -14 -13 -6 -5 -4 -3 -2 -1 0 1 2 10 11 12 13 14 100
 -5 -1 0
 -10 0 0 1 6 2 7
 Incorrect sequence
 -1 0 1 2 3 4
 0
 -10 0 -2 1 -1 2 0 3 1
 3 -2 5 -1 7 0 9 1 11 2
 -11 -2 -10 -1 0 0 10 1 11
 -1 -1 -1 0 0 0 1 1 1
 0 -1 10 0 11 1 12
 1000000000 1000000001 1000000002 1000000003 1000000004
 Incorrect sequence
 -11 -1 -10 0 -1 1 0
 -5 1 -13 -4 2 -12 -3 3 -11 -2 4 -10 -1 5 -9 0 6 -8 1 7 -7 2 8 -6 5 9 -5 6 10 -4 7 11 -3 8 12 -2 10 13 -1
 Incorrect sequence
 -2 -1 0 1 2 3 4
 -10 0 0 1 1 2 2
 -10 0 -7 1 -6 2 -1 3 0
 1 0 -1000000000 2 100 0 3
 -10 0 -3 1 -2 2 -1 3 0
 10 0 11 1 12 2 13 3 14
 -1 0 1
 -2 -1 0 1 2 3 4 5 6 10
 -1000000001 -1 -1000000000 0 0
 -1000000000 1000000000
 -10 0 -7 1 -6 2 0
 -1 0 0 0 2
 10 0 11 1 12 2 13
 -10 0 -2 1 -1 2 0
 -10 0 -1 1 0 2 1
 -11 -1 -10 0 10 1 11
 -3 -2 -1 0 1 3
 -10 0 -1 1 0 2 1 3 10
 Incorrect sequence
 -5 0 -1 -1 1 0 0 5 1
 -3 -2 -1 0 1 2 3 

#include <bits/stdc++.h>
using namespace std;
vector<vector<string> > cepi;
int main() {
  ios_base::sync_with_stdio(0);
  int n, kk;
  cin >> n >> kk;
  cepi.resize(min(kk, n));
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    cepi[i % kk].push_back(s);
  }
  long long ans = 0;
  for (int i = 0; i < kk; ++i) {
    int prev = -1;
    for (int j = 0; j < cepi[i].size(); ++j) {
      if (prev == -1) {
        if (cepi[i][j] == "?") {
          continue;
        } else {
          int t = stoi(cepi[i][j]);
          prev = j;
          if (t <= 0) {
            for (int k = j - 1; k >= 0; --k) {
              --t;
              stringstream ss;
              ss << t;
              cepi[i][k] = ss.str();
            }
          } else {
            if (j % 2 == 1) {
              if (t >= (j + 1) / 2) {
                cepi[i][j / 2] = "0";
                for (int k = 1; k <= j / 2; ++k) {
                  stringstream ss;
                  stringstream sss;
                  ss << k;
                  ss >> cepi[i][k + j / 2];
                  sss << -k;
                  sss >> cepi[i][k - j / 2];
                }
              } else {
                for (int k = j - 1; k >= 0; --k) {
                  --t;
                  stringstream ss;
                  ss << t;
                  cepi[i][k] = ss.str();
                }
              }
            } else {
              for (int k = j - 1; k >= 0; --k) {
                --t;
                stringstream ss;
                ss << t;
                cepi[i][k] = ss.str();
              }
            }
          }
        }
      } else {
        if (cepi[i][j] == "?") {
          continue;
        } else {
          if (stoi(cepi[i][j]) - stoi(cepi[i][prev]) < j - prev) {
            cout << "Incorrect sequence";
            return 0;
          }
          if (cepi[i][j][0] == '-' && cepi[i][prev][0] == '-') {
            int t = stoi(cepi[i][j]);
            for (int k = j - 1; k > prev; --k) {
              stringstream ss;
              ss << --t;
              ss >> cepi[i][k];
            }
          } else {
            if (cepi[i][j][0] != '-' && cepi[i][prev][0] != '-') {
              int t = stoi(cepi[i][prev]);
              for (int k = prev + 1; k < j; ++k) {
                stringstream ss;
                ss << ++t;
                ss >> cepi[i][k];
              }
            } else {
              int minus = stoi(cepi[i][prev]);
              int plus = stoi(cepi[i][j]);
              int mn = min(-minus, plus);
              if ((j + prev) % 2 == 0) {
                if (j - prev - 1 >= 2 * mn - 1) {
                  int t = 0;
                  cepi[i][(j + prev) / 2] = "0";
                  int middle = (j + prev) / 2;
                  for (int k = 1; k <= (j - prev - 2) / 2; ++k) {
                    stringstream ss;
                    stringstream sss;
                    ++t;
                    ss << t;
                    ss >> cepi[i][middle + k];
                    sss << -t;
                    sss >> cepi[i][middle - k];
                  }
                } else {
                  if (-minus >= plus) {
                    for (int k = j - 1; k > prev; --k) {
                      stringstream ss;
                      --plus;
                      ss << plus;
                      ss >> cepi[i][k];
                    }
                  } else {
                    for (int k = prev + 1; k < j; ++k) {
                      stringstream ss;
                      ++minus;
                      ss << minus;
                      ss >> cepi[i][k];
                    }
                  }
                }
              } else {
                int size = j - prev - 1;
                if (minus < (-size / 2) && plus > size / 2 - 1) {
                  size >>= 1;
                  size *= -1;
                  for (int k = prev + 1; k < j; ++k) {
                    stringstream ss;
                    ss << ++size;
                    ss >> cepi[i][k];
                  }
                  prev = j;
                  continue;
                }
                if (minus < (-size / 2 + 1) && plus > size / 2) {
                  size >>= 1;
                  size *= -1;
                  ++size;
                  stringstream ss;
                  for (int k = prev + 1; k < j; ++k) {
                    ss << --size;
                    ss >> cepi[i][k];
                  }
                  prev = j;
                  continue;
                }
                if (-minus >= plus) {
                  for (int k = j - 1; k > prev; --k) {
                    stringstream ss;
                    --plus;
                    ss << plus;
                    ss >> cepi[i][k];
                  }
                } else {
                  for (int k = prev + 1; k < j; ++k) {
                    stringstream ss;
                    ++minus;
                    ss << minus;
                    ss >> cepi[i][k];
                  }
                }
              }
            }
          }
          prev = j;
        }
      }
    }
    if (prev == -1) {
      if (cepi[i].size() % 2 == 1) {
        int t = 0;
        int middle = cepi[i].size() / 2;
        cepi[i][middle] = "0";
        for (int k = 1; k <= cepi[i].size() / 2; ++k) {
          stringstream ss;
          stringstream sss;
          ++t;
          ss << t;
          ss >> cepi[i][middle + k];
          sss << -t;
          sss >> cepi[i][middle - k];
        }
      } else {
        int t = 0;
        int middle = cepi[i].size() / 2;
        cepi[i][middle] = "0";
        for (int k = 1; k <= cepi[i].size() / 2 - 1; ++k) {
          stringstream ss;
          stringstream sss;
          ++t;
          ss << t;
          ss >> cepi[i][middle + k];
          sss << -t;
          sss >> cepi[i][middle - k];
        }
        stringstream ss;
        ++t;
        ss << -t;
        ss >> cepi[i][0];
      }
    } else {
      if (prev != cepi[i].size() - 1) {
        int pr = stoi(cepi[i][prev]);
        if (pr > 0) {
          for (int j = prev + 1; j < cepi[i].size(); ++j) {
            stringstream ss;
            ss << ++pr;
            ss >> cepi[i][j];
          }
        } else {
          int number = cepi[i].size() - prev - 1;
          if (-pr >= number) {
            int t = 0;
            for (int k = cepi[i].size() - 1; k > prev; --k) {
              stringstream ss;
              ss << t--;
              ss >> cepi[i][k];
            }
          } else {
            for (int j = prev + 1; j < cepi[i].size(); ++j) {
              stringstream ss;
              ss << ++pr;
              ss >> cepi[i][j];
            }
          }
        }
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << cepi[i % kk][i / kk] << " ";
  }
  return 0;
}
