#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
  long long i, j, n, k;
  long long ans[10000] = {0};
  long long fib[100000];
  long long fibsum[100000];
  fib[0] = 0;
  fib[1] = 1;
  fibsum[0] = 0;
  fibsum[1] = 1;
  i = 2;
  long long sum = 1;
  while (1) {
    fib[i] = (fib[i - 1] + fib[i - 2]);
    sum += fib[i];
    if (sum > 1000000000000000000) break;
    fibsum[i] = sum;
    i++;
  }
  cin >> n >> k;
  k--;
  while (k) {
    j = 0;
    while (fibsum[j] < k) j++;
    ans[n - j] = n - j + 1;
    ans[n - j + 1] = n - j;
    k -= (fibsum[j - 1] + 1);
  }
  for (int i = 1; i < n + 1; ++i) {
    if (ans[i] == 0)
      cout << i << " ";
    else
      cout << ans[i] << " ";
  }
  cout << "\n";
  return 0;
}
