Consider a distributed file system with multiple servers that store files. The goal is to implement Lamport's Logical Clock to generate timestamps for file operations and ensure proper ordering of events. Assume there are three servers: Server A$,$ Server B$,$ and Server C$.$

$1.$ Server A receives a request to create a new file and assigns Lamport timestamp $1$ to this file creation operation.

$2.$ Simultaneously, Server B receives a request to read an existing file and assigns Lamport timestamp $2$ to this read operation.

$3.$ Due to network delays, the file creation request from Server A arrives at Server B after the read request.

$4.$ Server B processes the read request and sends the file content to Server A with a Lamport timestamp of $3.$

$5.$ Meanwhile, Server C receives a request to update the file and assigns Lamport timestamp $4$ to this update operation.

$6.$ The update request from Server C arrives at Server B after Server B has sent the file content to Server A$.$

$7.$ All servers process the requests and perform the necessary file operations.

Implement Lamport's VECTOR Clock in any language to handle these events and print the timestamps associated with each server's file operations.