#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct ListNode {
    int val;
    struct ListNode* next;
};

struct ListNode* solution(struct ListNode* head, int x) {
    // Create two dummy heads
    struct ListNode beforeHead = {0, NULL};
    struct ListNode afterHead = {0, NULL};
    
    // Pointers to build the two lists
    struct ListNode* before = &beforeHead;
    struct ListNode* after = &afterHead;
    
    // Traverse original list
    struct ListNode* curr = head;
    while (curr) {
        if (curr->val < x) {
            before->next = curr;
            before = curr;
        } else {
            after->next = curr;
            after = curr;
        }
        curr = curr->next;
    }
    
    // Connect the two lists
    after->next = NULL;
    before->next = afterHead.next;
    
    return beforeHead.next;
}

struct ListNode* createNode(int val) {
    struct ListNode* node = (struct ListNode*)malloc(sizeof(struct ListNode));
    node->val = val;
    node->next = NULL;
    return node;
}

void printList(struct ListNode* head) {
    printf("[");
    int first = 1;
    while (head) {
        if (!first) printf(",");
        printf("%d", head->val);
        first = 0;
        head = head->next;
    }
    printf("]\n");
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    // Parse array manually
    struct ListNode* head = NULL;
    struct ListNode* tail = NULL;
    char* ptr = line + 1; // Skip [
    char* token;
    while ((token = strtok(ptr, ",]")) != NULL) {
        int val = atoi(token);
        struct ListNode* node = createNode(val);
        if (!head) {
            head = tail = node;
        } else {
            tail->next = node;
            tail = node;
        }
        ptr = NULL;
    }
    
    int x;
    scanf("%d", &x);
    
    struct ListNode* result = solution(head, x);
    printList(result);
    
    return 0;
}