#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
long long poW(long long base, long long p) {
  if (!p) return 1;
  long long ans = poW(base, p / 2);
  ans = (ans * ans) % 1000000007;
  if (p % 2) ans = (ans * base) % 1000000007;
  return ans;
}
long long C[1002][1002];
void nCr() {
  C[0][0] = 1;
  for (int i = 1; i < 1002; i++) {
    C[i][0] = 1;
    for (int j = 1; j < i + 1; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007;
  }
}
int main() {
  int n;
  long long k;
  int a[52];
  long long fib[52];
  fib[0] = fib[1] = 1;
  for (int i = 2; i < 51; i++) fib[i] = fib[i - 1] + fib[i - 2];
  while (scanf("%d %lld", &n, &k) == 2) {
    for (int i = 0; i < n; i++) {
      if (k <= fib[n - i - 1])
        a[i] = i + 1;
      else {
        k -= fib[n - i - 1];
        a[i] = i + 2;
        a[++i] = i;
      }
    }
    for (int i = 0; i < n; i++) {
      if (i) printf(" ");
      printf("%d", a[i]);
    }
    puts("");
  }
  return 0;
}
